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

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.

Cryptanalysis of an Image Encryption Algorithm Based on Two-Dimensional Hyperchaotic Map

“…Cryptographic designers often claim that the proposed encryption algorithm has good security based on a series of statistical test results. However, strict cryptanalysis shows that some chaotic encryption algorithms still have certain security loopholes, causing them to be cracked by attackers [ 30 , 31 , 32 , 33 ]. In the process of analyzing the security of the encryption algorithm, attackers try various methods to crack the algorithm and gradually develop some classic cryptanalysis methods.…”