Cryptanalysis of an Image Encryption Using 2D Henon-Sine Map and DNA Approach

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

“…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.…”

“…e image encryption algorithm based on DNA encoding and spatiotemporal chaos is proposed in [15]; nevertheless, it is broken in [29] by using chosen-plaintext attack and chosenciphertext attack with lower computation complexity and data complexity, respectively. In [30], the security analysis of an image encryption algorithm based on 2D Henon-Sine map and DNA proposed in [17] is given; it is found that cipher image can be cracked by utilizing chosen-plaintext attack without known keys, and its attack complexity is O (18).…”

The Memorable Image Encryption Algorithm Based on Neuron-Like Scheme

“…Up to now, a large number of image cryptosystems based on chaotic systems have been found to be unsafe [24,25,26,27,28,29,30,31]. These cryptosystems cannot resist chosen/known plaintext attacks [32,33,34,35,36,37,38,39,40,41] because they possess plaintext-unrelated equivalent keys. A chosen plaintext attack method in [32] cracked the scheme in [24] with only 18 attacks for 256×256-sized images.…”

“…These cryptosystems cannot resist chosen/known plaintext attacks [32,33,34,35,36,37,38,39,40,41] because they possess plaintext-unrelated equivalent keys. A chosen plaintext attack method in [32] cracked the scheme in [24] with only 18 attacks for 256×256-sized images. Feng et al pointed out in [33] that the system in [25] has some shortcomings, such as small key space and plaintext-unrelated equivalent keys.…”

“…From the above, it can be seen that these image cryptosystems [24,25,26,27,28,29,30,31] are insecure, not because they used the chaotic systems with simple dynamic equations, nor because the statistical characteristics of chaotic pseudo-random sequences used are not good, but because their confusion or diffusion schemes are not well designed, which makes their equivalent keys directly involved in image encryption insensitive to plain images. These image cryptosystems are separately cracked by [32,33,34,35,36,37,38,39,40,41], and the main decoding algorithms are the chosen/known plaintext methods. The objects of attack mainly focus on the equivalent keys [42].…”