Journal
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS
Volume 25, Issue 13, Pages -Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0218127415501886
Keywords
Chaotic image encryption; cryptanalysis; known-plaintext attack; chosen-plaintext attack; Logistic map
Funding
- Distinguished Young Scholar Program, Hunan Provincial Natural Science Foundation of China [2015JJ1013]
- Scientific Research Fund of Hunan Provincial Education Department [15A186]
- Natural Science Foundation of China [61202398, 61532020]
Ask authors/readers for more resources
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 O(2(18) + L); (2) two pairs of chosen plain-images and the corresponding cipher-images with computational complexity of O(L), where L is the number of pixels in the plain-image. In contrast, the required condition in the previous deciphering method is 87 pairs of chosen plain-images and the corresponding cipher-images with computational complexity of O(2(7) + L). In addition, three other security flaws existing in most Logistic-map-based ciphers are also reported.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available