Breaking a novel image encryption scheme based on improved hyperchaotic sequences

Abstract

Recently, a novel image encryption scheme based on improved hyperchaotic sequences was proposed. A pseudo-random number sequence, generated by a hyper-chaos system, is used to determine two involved encryption functions, bitwise exclusive or (XOR) operation and modulo addition. It was reported that the scheme can be broken with some pairs of chosen plain-images and the corresponding cipherimages. This paper re-evaluates the security of the encryption scheme and finds that the encryption scheme can be broken with only one known plain-image. The performance of the known-plaintext attack, in terms of success probability and computation load, become even much better when two known plain-images are available. In addition, security defects on insensitivity of the encryption result with respect to changes of secret key and plain-image are also reported.

6 pages

References in corpus (3)

• On the security defects of an image encryption scheme
• Breaking a chaotic image encryption algorithm based on modulo addition and XOR operation
• On the Security of the Yi-Tan-Siew Chaos-Based Cipher

Cited by in corpus (7)

• On the cryptanalysis of Fridrich's chaotic image encryption scheme
• Cryptanalyzing an Image-Scrambling Encryption Algorithm of Pixel Bits
• Cryptanalyzing a RGB image encryption algorithm based on DNA encoding and chaos map
• Deciphering a novel image cipher based on mixed transformed Logistic maps
• Cryptanalysis of a Classical chaos-based cryptosystem with some quantum cryptography features
• Design and ARM-embedded implementation of a chaotic map-based multicast scheme for multiuser speech wireless communication
• Differential cryptanalysis of image cipher using block-based scrambling and image filtering