Image Encryption Using Chaotic Maps and DNA Encoding

2020 ◽  
Vol 14 (4) ◽  
2019 ◽  
Vol 29 (08) ◽  
pp. 1950103 ◽  
Author(s):  
Kirtee Panwar ◽  
Ravindra Kumar Purwar ◽  
Anchal Jain

This paper presents cryptanalysis of a color image encryption scheme. DNA encoding and multiple 1D chaotic maps are used in the encryption process which increases its computational speed. The key streams generated in this scheme are dependent on secret keys, updated using the sum of pixel intensities of plain image of size [Formula: see text]. This paper analyzes the security of encryption scheme against the chosen plaintext attack and finds that only [Formula: see text] different key matrices for diffusion are possible, an equivalent version of which can be revealed with [Formula: see text] chosen plain images. Experimental results are presented to prove that equivalent diffusion keys and block permutation sequence can be effectively revealed through the attack. In addition, low sensitivity of keys towards changes in plaintext along with insecure diffusion process involved in encryption process is also reported. Finally, to remedy the shortcomings of the original encryption scheme, an enhanced encryption scheme is generated that can resist chosen/known plaintext attack while maintaining the merits of the original encryption scheme.


2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Jian Zhang ◽  
DongXin Fang ◽  
Honge Ren

We propose a new image encryption algorithm based on DNA sequences combined with chaotic maps. This algorithm has two innovations: (1) it diffuses the pixels by transforming the nucleotides into corresponding base pairs a random number of times and (2) it confuses the pixels by a chaotic index based on a chaotic map. For any size of the original grayscale image, the rows and columns are fist exchanged by the arrays generated by a logistic chaotic map. Secondly, each pixel that has been confused is encoded into four nucleotides according to the DNA coding. Thirdly, each nucleotide is transformed into the corresponding base pair a random number of time(s) by a series of iterative computations based on Chebyshev’s chaotic map. Experimental results indicate that the key account of this algorithm is 1.536 × 10127, the correlation coefficient of a 256 × 256 Lena image between, before, and after the encryption processes was 0.0028, and the information entropy of the encrypted image was 7.9854. These simulation results and security analysis show that the proposed algorithm not only has good encryption effect, but also has the ability to repel exhaustive, statistical, differential, and noise attacks.


Author(s):  
K Aditya ◽  
Ashish K Mohanty ◽  
G Aravinth Ragav ◽  
V Thanikaiselvan ◽  
R Amirtharajan

Author(s):  
Prabir Kumar Naskar ◽  
Surojit Bhattacharyya ◽  
Kailash Chandra Mahatab ◽  
Krishna Gopal Dhal ◽  
Atal Chaudhuri

Sign in / Sign up

Export Citation Format

Share Document