CRYPTANALYSIS OF FRIDRICH'S CHAOTIC IMAGE ENCRYPTION

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.

Download Full-text

An Image Encryption Algorithm Based on Random Hamiltonian Path

Entropy ◽

10.3390/e22010073 ◽

2020 ◽

Vol 22 (1) ◽

pp. 73 ◽

Cited By ~ 1

Author(s):

Wei Zhang ◽

Shuwen Wang ◽

Weijie Han ◽

Hai Yu ◽

Zhiliang Zhu

Keyword(s):

Image Encryption ◽

Hamiltonian Path ◽

Correlation Coefficients ◽

Encryption Algorithm ◽

Encryption Scheme ◽

Encryption Algorithms ◽

Simulation Results ◽

Bit Planes ◽

Random Hamiltonian ◽

Image Encryption Algorithm

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.

Download Full-text

New chaotic image encryption algorithm based on hybrid feedback

Journal of Computer Applications ◽

10.3724/sp.j.1087.2008.00434 ◽

2008 ◽

Vol 28 (2) ◽

pp. 434-436 ◽

Cited By ~ 2

Author(s):

Jie GAO

Keyword(s):

Image Encryption ◽

Encryption Algorithm ◽

Chaotic Image Encryption ◽

Image Encryption Algorithm

Download Full-text

Adaptive Chaotic Image Encryption Algorithm Based on RNA and Pixel Depth

Electronics ◽

10.3390/electronics10151770 ◽

2021 ◽

Vol 10 (15) ◽

pp. 1770

Author(s):

Xiaoqiang Zhang ◽

Xuangang Yan

Keyword(s):

Image Encryption ◽

Three Dimensional ◽

Encryption Algorithm ◽

Current Time ◽

Plain Image ◽

Scope Of Application ◽

Selective Diffusion ◽

Chaotic Image Encryption ◽

And Diffusion ◽

Image Encryption Algorithm

To prevent the leakage of image content, image encryption technology has received increasing attention. Most current algorithms are only suitable for the images of certain types and cannot update keys in a timely manner. To tackle such problems, we propose an adaptive chaotic image encryption algorithm based on RNA and pixel depth. Firstly, a novel chaotic system, two-dimensional improved Logistic-adjusted-Sine map is designed. Then, we propose a three-dimensional adaptive Arnold transform for scrambling. Secondly, keys are generated by the hash values of the plain image and current time to achieve one-image, one-key, and one-time pad simultaneously. Thirdly, we build a pre-permuted RNA cube for 3D adaptive scrambling by pixel depth, chaotic sequences, and adaptive RNA coding. Finally, selective diffusion combined with pixel depth and RNA operations is performed, in which the RNA operators are determined by the chemical structure and properties of amino acids. Pixel depth is integrated into the whole procedure of parameter generation, scrambling, and diffusion. Experiments and algorithm analyses show that our algorithm has strong security, desirable performance, and a broader scope of application.

Download Full-text