Breaking a chaotic image encryption algorithm based on modulo addition and XOR operation

Abstract

This paper re-evaluates the security of a chaotic image encryption algorithm called MCKBA/HCKBA and finds that it can be broken efficiently with two known plain-images and the corresponding cipher-images. In addition, it is reported that a previously proposed breaking on MCKBA/HCKBA can be further improved by reducing the number of chosen plain-images from four to two. The two attacks are both based on the properties of solving a composite function involving the carry bit, which is composed of the modulo addition and the bitwise OR operations. Both rigorous theoretical analysis and detailed experimental results are provided.

12 pages, 3 figures

References in corpus (3)

• On the security defects of an image encryption scheme
• On the Security of the Yi-Tan-Siew Chaos-Based Cipher
• On the security of the Yen-Guo's domino signal encryption algorithm (DSEA)

Cited by in corpus (5)

• On the cryptanalysis of Fridrich's chaotic image encryption scheme
• Breaking a novel image encryption scheme based on improved hyperchaotic sequences
• Deciphering a novel image cipher based on mixed transformed Logistic maps
• On the security of a class of diffusion mechanisms for image encryption
• Chosen-plaintext attack of an image encryption scheme based on modified permutation-diffusion structure