Image Encryption Algorithm Based on Genetic Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1512-1516
Author(s):  
Gui Liang Zhu ◽  
Wei Ping Wang ◽  
Xiao Qiang Zhang

According to the idea of genetic algorithm, a new image encryption algorithm is proposed. Define each pixel of the image as a gene, each row of the image as a chromosome, the whole image as an organism. Then we design a selection operator, which based on SVD. After the operation of selection, crossover and mutation of the image, we can get the encrypted image. The simulation results show that very nice encryption effects and good robustness are obtained and the high safety of the new algorithm are analyzed.

2010 ◽  
Vol 20 (05) ◽  
pp. 1405-1413 ◽  
Author(s):  
ERCAN SOLAK ◽  
CAHIT ÇOKAL ◽  
OLCAY TANER YILDIZ ◽  
TÜRKER BIYIKOĞLU

We cryptanalyze Fridrich's chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosen-ciphertext attacks. We propose an attack that reveals the secret permutation that is used to shuffle the pixels of a round input. We demonstrate the effectiveness of our attack with examples and simulation results. We also show that our proposed attack can be generalized to other well-known chaotic image encryption algorithms.


Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1159
Author(s):  
Zeming Wu ◽  
Ping Pan ◽  
Chunyang Sun ◽  
Bing Zhao

To address the problems of the high complexity and low security of the existing image encryption algorithms, this paper proposes a dynamic key chaotic image encryption algorithm with low complexity and high security associated with plaintext. Firstly, the RGB components of the color image are read, and the RGB components are normalized to obtain the key that is closely related to the plaintext, and then the Arnold transform is used to stretch and fold the RGB components of the color image to change the position of the pixel points in space, so as to destroy the correlation between the adjacent pixel points of the image. Next, the generated sequences are independently encrypted with the Arnold-transformed RGB matrix. Finally, the three encrypted images are combined to obtain the final encrypted image. Since the key acquisition of this encryption algorithm is related to the plaintext, it is possible to achieve one key per image, so the key acquisition is dynamic. This encryption algorithm introduces chaotic mapping, so that the key space size is 10180. The key acquisition is closely related to the plaintext, which makes the ciphertext more random and resistant to differential attacks, and ensures that the ciphertext is more secure after encryption. The experiments show that the algorithm can encrypt the image effectively and can resist attack on the encrypted image.


2013 ◽  
Vol 694-697 ◽  
pp. 2016-2020
Author(s):  
Shu Cong Liu ◽  
Yan Xing Song ◽  
Jing Song Yang

A new image encryption algorithm based on chaotic sequence is proposed, and the over sampled techniques is used in the Chebyshev mapping and Logistic chaotic mapping to generate multi-parameter chaotic key.A chaotic image encryption transmission system is build to achieve the encryption and decryption of the image signal,and the security and the encryption properties of the algorithm are analyzed. Simulation results show that the method ia simple and easy to achieve, and with larger key space ang good encryption effect.


Entropy ◽  
2020 ◽  
Vol 22 (1) ◽  
pp. 73 ◽  
Author(s):  
Wei Zhang ◽  
Shuwen Wang ◽  
Weijie Han ◽  
Hai Yu ◽  
Zhiliang Zhu

In graph theory, Hamiltonian path refers to the path that visits each vertex exactly once. In this paper, we designed a method to generate random Hamiltonian path within digital images, which is equivalent to permutation in image encryption. By these means, building a Hamiltonian path across bit planes can shuffle the distribution of the pixel’s bits. Furthermore, a similar thought can be applied for the substitution of pixel’s grey levels. To ensure the randomness of the generated Hamiltonian path, an adjusted Bernoulli map is proposed. By adopting these novel techniques, a bit-level image encryption scheme was devised. Evaluation of simulation results proves that the proposed scheme reached fair performance. In addition, a common flaw in calculating correlation coefficients of adjacent pixels was pinpointed by us. After enhancement, correlation coefficient becomes a stricter criterion for image encryption algorithms.


Entropy ◽  
2021 ◽  
Vol 24 (1) ◽  
pp. 40
Author(s):  
Haiju Fan ◽  
Heng Lu ◽  
Chenjiu Zhang ◽  
Ming Li ◽  
Yanfang Liu

Recently, an image encryption algorithm based on random walk and hyperchaotic systems has been proposed. The main idea of the original paper is to scramble the plain image by means of random walk matrix and then to append diffusion. In this paper, the encryption method with security holes is analyzed by chosen plaintext attack. In addition, this paper improves the original encryption algorithm. The experimental and simulation results show that the improved algorithm has the advantages of the original and can improve the ability to resist attack.


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.


Sign in / Sign up

Export Citation Format

Share Document