Cryptanalysis of an image encryption cryptosystem based on binary bit planes extraction and multiple chaotic maps

Wen, Heping; Yu, Simin

doi:10.1140/epjp/i2019-12797-4

Cited by 37 publications

(30 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, chaotic cryptography still lacks authoritative metrics, especially in terms of security. Accordingly, many reported chaotic encryption algorithms have been broken [ 12 , 13 , 14 , 15 ]. As shown in Table 1 , some previous chaos-based ciphers are vulnerable upon various attack methods, including chosen-ciphertext attack [ 16 ], chosen-/known-plaintext attack [ 12 ], differential cryptanalysis [ 17 ], even cipher-only attack [ 18 ].…”

Section: Introductionmentioning

confidence: 99%

Security Analysis of a Color Image Encryption Algorithm Using a Fractional-Order Chaos

Wen

Zhang

Huang

et al. 2021

Entropy

Self Cite

View full text Add to dashboard Cite

Fractional-order chaos has complex dynamic behavior characteristics, so its application in secure communication has attracted much attention. Compared with the design of fractional-order chaos-based cipher, there are fewer researches on security analysis. This paper conducts a comprehensive security analysis of a color image encryption algorithm using a fractional-order hyperchaotic system (CIEA-FOHS). Experimental simulation based on excellent numerical statistical results supported that CIEA-FOHS is cryptographically secure. Yet, from the perspective of cryptanalysis, this paper found that CIEA-FOHS can be broken by a chosen-plaintext attack method owing to its some inherent security defects. Firstly, the diffusion part can be eliminated by choosing some special images with all the same pixel values. Secondly, the permutation-only part can be deciphered by some chosen plain images and the corresponding cipher images. Finally, using the equivalent diffusion and permutation keys obtained in the previous two steps, the original plain image can be recovered from a target cipher image. Theoretical analysis and experimental simulations show that the attack method is both effective and efficient. To enhance the security, some suggestions for improvement are given. The reported results would help the designers of chaotic cryptography pay more attention to the gap of complex chaotic system and secure cryptosystem.

show abstract

Section: Introductionmentioning

confidence: 99%

Security Analysis of a Color Image Encryption Algorithm Using a Fractional-Order Chaos

Wen

Zhang

Huang

et al. 2021

Entropy

Self Cite

View full text Add to dashboard Cite

show abstract

“…After analyzing the image cryptosystem [ 9 ], Liu et al [ 20 ] reported that the correlation information among adjacent plain pixels cannot be erased by the row/column-wise permutation, thereby leaving an open door for the known-plaintext attack. Wen and Yu [ 21 ] ascertained that, in the image cryptosystem [ 9 ], keys are not associated with the plain images. Exploiting this security flaw, they launched a cracking attack in a divide-and-conquer manner.…”

Section: Introductionmentioning

confidence: 99%

On the Cryptanalysis of a Latin Cubes-Based Image Cryptosystem

Liu

Liao

Dong

2021

Entropy

View full text Add to dashboard Cite

Based on orthogonal Latin cubes, an image cryptosystem with confusion–diffusion–confusion cipher architecture has been proposed recently (Inf. Sci.2019, 478, 1–14). However, we find that there are four fatal vulnerabilities in this image cryptosystem, which leave open doors for cryptanalysis. In this paper, we propose a reference-validation inference algorithm and design screening-based rules to efficiently break the image cryptosystem. Compared with an existing cryptanalysis algorithm, the proposed method requires fewer pairs of chosen plain-cipher images, and behaves stably since different keys, positions of chosen bits and contents of plain images will not affect the cryptanalysis performance. Experimental results show that our cryptanalysis algorithm only requirespairs of chosen plain-cipher images, whererepresents the image’s resolution. Comparative studies demonstrate effectiveness and superiority of the proposed cryptanalysis algorithm.

show abstract

“…e security performance of the image encryption algorithms mainly depends on statistical test indicators, such as key space, histogram, key sensitivity analysis, information entropy, differential attack, and so on. However, statistical test indicator is an essential condition and not a sufficient condition for measuring security presented in [19]; moreover, some of them are proven to be insecure due to their inherent pitfalls [20][21][22][23][24][25][26][27][28][29][30]. erefore, it is necessary to perform cryptanalysis in order to improve the security of the image encryption algorithms.…”

Section: Introductionmentioning

confidence: 99%

“…In recent years, many image encryption algorithms have been cryptanalyzed by the researchers. For example, in [20], the cryptanalysis of an image encryption cryptosystem based on binary bit planes extraction and multiple chaotic maps (IEC-BPMC) proposed in [1] is given; it is pointed out that IEC-BPMC is insecure against chosen-plaintext attack. In [21], the security analysis of an image chaotic encryption algorithm based on Latin cubes and bit cubes presented in [2] is proposed; it is reported that the generation of Latin cubes 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.…”

Section: Introductionmentioning

confidence: 99%

On the Security Analysis of a Hopfield Chaotic Neural Network-Based Image Encryption Algorithm

Zhang

2020

Complexity

Self Cite

View full text Add to dashboard Cite

In this paper, the security analysis of a color image encryption algorithm based on Hopfield chaotic neural network is given. The original chaotic image encryption algorithm includes permutation encryption and diffusion encryption. The result of cryptanalysis shows that the chaotic sequences generated by this algorithm are independent of plaintext image, and there exist equivalent permutation key and equivalent diffusion key. Therefore, according to chosen-plaintext attack, the equivalent diffusion key and the equivalent permutation key can be obtained by choosing two special plaintext images and the corresponding ciphertext images, respectively, and the plaintext image is further recovered from the ciphertext image. Theoretical analysis and numerical simulation experiment results verify the effectiveness of the analytical method. Finally, some improved suggestions for the original encryption algorithm are proposed to promote the security.

show abstract

Cryptanalysis of an image encryption cryptosystem based on binary bit planes extraction and multiple chaotic maps

Cited by 37 publications

References 35 publications

Security Analysis of a Color Image Encryption Algorithm Using a Fractional-Order Chaos

Security Analysis of a Color Image Encryption Algorithm Using a Fractional-Order Chaos

On the Cryptanalysis of a Latin Cubes-Based Image Cryptosystem

On the Security Analysis of a Hopfield Chaotic Neural Network-Based Image Encryption Algorithm

Contact Info

Product

Resources

About