Cryptanalysis of two chaotic encryption schemes based on circular bit shift and XOR operations
arXiv:nlin/0611017 · doi:10.1016/j.physleta.2007.04.023
Abstract
Recently two encryption schemes were proposed by combining circular bit shift and XOR operations, under the control of a pseudorandom bit sequence (PRBS) generated from a chaotic system. This paper studies the security of these two encryption schemes and reports the following findings: 1) there exist some security defects in both schemes; 2) the underlying chaotic PRBS can be reconstructed as an equivalent key by using only two chosen plaintexts; 3) most elements in the underlying chaotic PRBS can be obtained by a differential known-plaintext attack using only two known plaintexts. Experimental results are given to demonstrate the feasibility of the proposed attack.
17 pages, 8 figures
References in corpus (1)
Cited by in corpus (13)
- Shannon Entropy based Randomness Measurement and Test for Image Encryption
- Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
- Breaking a Chaotic Cryptographic Scheme Based on Composition Maps
- Fault tolerant channel-encrypting quantum dialogue against collective noise
- Deciphering a novel image cipher based on mixed transformed Logistic maps
- Cryptanalysis of an image encryption scheme based on the Hill cipher
- Quantum Conference
- A novel pseudo-random number generator based on discrete chaotic iterations
- Breaking an image encryption algorithm based on chaos
- Image encryption with dynamic chaotic Look-Up Table
- Breaking a chaotic image encryption algorithm based on perceptron model
- Breaking a new substitution-diffusion based image cipher using chaotic standard and logistic maps
- Breaking a modified substitution-diffusion image cipher based on chaotic standard and logistic maps