Cryptanalyzing a Color Image Encryption Scheme Based on Hybrid Hyper-Chaotic System and Cellular Automata

Li, Ming; Lü, Dandan; Wen, Wenying; Ren, Hua; Zhang, Yushu

doi:10.1109/access.2018.2867111

Cited by 55 publications

(37 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the chaotic encryption schemes proposed in [1-4, 6-15, 20] adopt the classical permutation-diffusion two-stage encryption structure; security test metrics are mainly limited to histogram, correlation analysis, differential analysis, key sensitivity test, and so on, which are not enough to guarantee cryptosystem security. In [21][22][23][24][25][26][27][28][29][30][31][32], the cryptanalysis literature studies point that many chaotic encryption algorithms have some intrinsic security weaknesses, which are not robust against chosen-plaintext attack, chosen-ciphertext attack, and conquer attack. In addition, the chaotic encryption algorithm proposed in [5] adopts permutation-only structure; however, 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 then recovering the corresponding original plaintext image.…”

Section: Introductionmentioning

confidence: 99%

On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

Zhang

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

Zhang

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…However, the high uniformity of ciphertext does not mean that the encryption algorithm has high security performance. For example, in [24], the security analysis of an image chaotic encryption algorithm proposed in [16] is given, and it is found that the generation of key stream is related to the sum of pixel values of plain images. Under the premise of satisfying the sum of pixel values of a plain image unchanged, only two pixel values of cipher image are changed corresponding to the variation of two pixel values of a plain image, which is vulnerable to differential attack.…”

Section: Introductionmentioning

confidence: 99%

On the Security of a Latin-Bit Cube-Based Image Chaotic Encryption Algorithm

Zhang

2019

Entropy

View full text Add to dashboard Cite

In this paper, the security analysis of an image chaotic encryption algorithm based on Latin cubes and bit cubes is given. The proposed algorithm adopts a first-scrambling-diffusion- second-scrambling three-stage encryption scheme. First, a finite field is constructed using chaotic sequences. Then, the Latin cubes are generated from finite field operation and used for image chaotic encryption. In addition, according to the statistical characteristics of the diffusion image in the diffusion stage, the algorithm also uses different Latin cube combinations to scramble the diffusion image for the second time. However, the generation of Latin cubes in this algorithm is independent of plain image, while, in the diffusion stage, when any one bit in the plain image changes, the corresponding number of bits in the cipher image follows the change with obvious regularity. Thus, the equivalent secret keys can be obtained by chosen plaintext attack. Theoretical analysis and experimental results indicate that only a maximum of 2 . 5 × w × h 3 + 6 plain images are needed to crack the cipher image with w × h resolution. The size of equivalent keys deciphered by the method proposed in this paper are much smaller than other general methods of cryptanalysis for similar encryption schemes.

show abstract

“…e original image encryption algorithms were based on the "confusion-di usion" encryption framework proposed by Fridrich. With the continuous development of hardware technology and cryptanalysis technology, most of the current image encryption algorithms are designed by integrating various technologies, such as DNA coding [1], optical technology [2], cellular automata [3,4], and asymmetric cryptosystems [5], which guarantees the security of image transmission and storage on some resource sharing platforms. However, with the rapid development of communication networks, the increasing demand for real-time transmission, and increasing image sizes, ensuring the security and real-time performance of the transmission of massive images in bandwidth-constrained networks has become an urgent problem that needs to be solved.…”

Section: Introductionmentioning

confidence: 99%

Novel Meaningful Image Encryption Based on Block Compressive Sensing

Pan

Huang

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

is paper proposes a new image compression-encryption algorithm based on a meaningful image encryption framework. In block compressed sensing, the plain image is divided into blocks, and subsequently, each block is rendered sparse. e zigzag scrambling method is used to scramble pixel positions in all the blocks, and subsequently, dimension reduction is undertaken via compressive sensing. To ensure the robustness and security of our algorithm and the convenience of subsequent embedding operations, each block is merged, quantized, and disturbed again to obtain the secret image. In particular, landscape paintings have a characteristic hazy beauty, and secret images can be camou aged in them to some extent. For this reason, in this paper, a landscape painting is selected as the carrier image. After a 2-level discrete wavelet transform (DWT) of the carrier image, the lowfrequency and high-frequency coe cients obtained are further subjected to a discrete cosine transform (DCT). e DCT is simultaneously applied to the secret image as well to split it. Next, it is embedded into the DCT coe cients of the low-frequency and high-frequency components, respectively. Finally, the encrypted image is obtained. e experimental results show that, under the same compression ratio, the proposed image compression-encryption algorithm has better reconstruction e ect, stronger security and imperceptibility, lower computational complexity, shorter time consumption, and lesser storage space requirements than the existing ones.

show abstract

Cryptanalyzing a Color Image Encryption Scheme Based on Hybrid Hyper-Chaotic System and Cellular Automata

Cited by 55 publications

References 38 publications

On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

On the Security of a Latin-Bit Cube-Based Image Chaotic Encryption Algorithm

Novel Meaningful Image Encryption Based on Block Compressive Sensing

Contact Info

Product

Resources

About