Differential evolution optimization of intertwining logistic map-DNA based image encryption technique

2019 ◽  
Vol 11 (9) ◽  
pp. 3771-3786 ◽  
Author(s):  
Mohit Dua ◽  
Aishwarya Wesanekar ◽  
Vishwas Gupta ◽  
Mayank Bhola ◽  
Shelza Dua
2018 ◽  
Vol 32 (09) ◽  
pp. 1850115 ◽  
Author(s):  
Manjit Kaur ◽  
Vijay Kumar

In this paper, a robust image encryption technique that utilizes Fourier–Mellin moments and intertwining logistic map is proposed. Fourier–Mellin moment-based intertwining logistic map has been designed to overcome the issue of low sensitivity of an input image. Multi-objective Non-Dominated Sorting Genetic Algorithm (NSGA-II) based on Reinforcement Learning (MNSGA-RL) has been used to optimize the required parameters of intertwining logistic map. Fourier–Mellin moments are used to make the secret keys more secure. Thereafter, permutation and diffusion operations are carried out on input image using secret keys. The performance of proposed image encryption technique has been evaluated on five well-known benchmark images and also compared with seven well-known existing encryption techniques. The experimental results reveal that the proposed technique outperforms others in terms of entropy, correlation analysis, a unified average changing intensity and the number of changing pixel rate. The simulation results reveal that the proposed technique provides high level of security and robustness against various types of attacks.


Author(s):  
Shelza Dua ◽  
Bharath Nancharla ◽  
Maanak Gupta

The authors propose an image encryption process based on chaos that uses block scrambling to reduce the correlation among the neighboring pixels and random order substitution for slightly changing the value of the pixel. The chaotic sequence for encrypting the image is generated by using two 3D logistic maps called enhanced logistic map and intertwining logistic map; the cos function helps in reducing linearity. The entire encryption process is composed of scrambling, image rotation, and random order substitution. Scrambling is used for permuting the pixels in the image so that we can reduce the correlation among the neighboring pixels, and this is followed by image rotation which can ensure that shuffling of pixels is done to the remaining pixels in the image, and at last the authors use random order substitution where they bring the small change in the pixel value. The proposed method has the capability of encrypting digital colored images into cipher form with high security, which allows only authorized ones who hold the correct secret key to decrypt the images back to original form.


2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.


Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 474 ◽  
Author(s):  
Lazaros Moysis ◽  
Christos Volos ◽  
Sajad Jafari ◽  
Jesus M. Munoz-Pacheco ◽  
Jacques Kengne ◽  
...  

A modification of the classic logistic map is proposed, using fuzzy triangular numbers. The resulting map is analysed through its Lyapunov exponent (LE) and bifurcation diagrams. It shows higher complexity compared to the classic logistic map and showcases phenomena, like antimonotonicity and crisis. The map is then applied to the problem of pseudo random bit generation, using a simple rule to generate the bit sequence. The resulting random bit generator (RBG) successfully passes the National Institute of Standards and Technology (NIST) statistical tests, and it is then successfully applied to the problem of image encryption.


Sign in / Sign up

Export Citation Format

Share Document