Deciphering a novel image cipher based on mixed transformed Logistic maps
arXiv:1404.3600 · doi:10.1142/S0218127415501886
Abstract
Since John von Neumann suggested utilizing Logistic map as a random number generator in 1947, a great number of encryption schemes based on Logistic map and/or its variants have been proposed. This paper re-evaluates the security of an image cipher based on transformed logistic maps and proves that the image cipher can be deciphered efficiently under two different conditions: 1) two pairs of known plain-images and the corresponding cipher-images with computational complexity of ; 2) two pairs of chosen plain-images and the corresponding cipher-images with computational complexity of , where is the number of pixels in the plain-image. In contrast, the required condition in the previous deciphering method is eighty-seven pairs of chosen plain-images and the corresponding cipher-images with computational complexity of . In addition, three other security flaws existing in most Logistic-map-based ciphers are also reported.
arXiv comment10 pages, 2 figures
References in corpus (7)
- Cryptographic requirements for chaotic secure communications
- Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
- Breaking a novel image encryption scheme based on improved hyperchaotic sequences
- Cryptanalyzing image encryption using chaotic logistic map
- Cryptanalysis of dynamic look-up table based chaotic cryptosystems
- Cryptanalysis of two chaotic encryption schemes based on circular bit shift and XOR operations
- Breaking a chaotic image encryption algorithm based on modulo addition and XOR operation