1. 1
Image encryption using
chaotic logistic map
Deepak Kumar Mishra
Department of Computer Science and
Engineering
Ambalika Institute of Management and
Technology Lucknow

2. 2
Outline
 Introduction
 Proposed scheme
 Experimental results
 Conclusions

3. 3
Introduction
Encryption
Decryption
Gray scale image encrypted image

5. 5
Flowchart
Two chaotic
logistic maps
X,Y
Session key
Y’s
value
Block encryption
Secret key
Change
session key

6. 6
Secret key K
 80-bit long , Ki is one 8-bit block of K
 (in hexadecimal)
 Session key: choose three blocks of secret key
 Choose two session keys for two logistic maps
 K4K5K6 for the first logistic map X
 K1K2K3 for the second logistic map Y
20194321 ... kkkkkkK =
K1 K2 K10

7. Formula
If X(m,n) is a pixel located at (m,n), then the 1th bit
of X(m,n) is :

8. 8
Logistic map
X0 0.3
X1 0.839979
X2 0.537643
X3 0.996915
X4 0.012301
X5 0.048957
X6 0.095869
X7 0.346703
Initial value X0 , 0<= X0 <=1

9. 9
Experimental results

10. 10
Experimental results(2/3)
Encryption

11. 11
Experimental results(3/3)

12. Comparisons

13. 13
Conclusions
 Useful for real time image encryption
 Secure
 Proposed encryption algorithm can
ensure multiple criteria such as
lossless, minimum distortion,
maximum performance and maximum
speed.