Abstract
In this paper, the security analysis of a bit-level image chaotic encryption algorithm based on the 1D chaotic map is proposed. The original image chaotic encryption algorithm includes bit-level permutation encryption, diffusion encryption, and linear transform. Deciphering of it can be divided into two stages. First, bit-level permutation encryption, diffusion encryption, and linear transform can be simplified into bit-level equivalent permutation encryption and equivalent diffusion encryption, which is a key breakthrough point of cryptanalysis. Second, the chaotic sequence generated by this algorithm is independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be obtained by chosen-plaintext attack, respectively. Theoretical analysis and numerical simulation experiment results verify the effectiveness of the analytical method. Finally, some suggestions are proposed to promote the security of the original image chaotic encryption algorithm.
Highlights
With the rapid development of network technology, a large amount of multimedia information, such as image, voice, text, and video, needs to be transmitted through the Internet.erefore, the security problem becomes an important research subject and attracts more and more attention
In 1997, the first image chaotic encryption algorithm based on the permutation-diffusion structure is proposed in [2]. ereafter, a symmetric image encryption algorithm based on 3D chaotic cat map is presented in [1]
An image chaotic encryption algorithm based on CHHCS and LBP is proposed in [14], where CHHCS is used to scramble the plaintext image, while LBP is considered to diffuse the scrambled image in order to change the values of all pixels
Summary
With the rapid development of network technology, a large amount of multimedia information, such as image, voice, text, and video, needs to be transmitted through the Internet. In 1997, the first image chaotic encryption algorithm based on the permutation-diffusion structure is proposed in [2]. In [4], a novel image encryption algorithm based on the skew tent chaotic map and classic permutation-diffusion structure is proposed. The chaotic encryption algorithm proposed in [5] adopts permutation-only structure; permutation-only is vulnerable to chosen-plaintext attack given in [33,34,35,36]; for example, according to the chosen-plaintext attack, one can obtain equivalent permutation keys by choosing several pairs of plaintext-ciphertext images and recovering the corresponding original plaintext image. Is paper re-evaluates the security of a bit-level image encryption algorithm based on the 1D chaotic map proposed in [37].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
