Security analysis of a binary image permutation scheme based on Logistic map
Chengqing Li, Kwok‐Tung Lo · arXiv (Cornell University) · 2009
In [Pattern Recognition Letters, in press, doi:10.1016/j.patrec.2009.11.008], an image scrambling encryption algorithm of pixel bit based on chaos map was proposed. Considering the algorithm as a typical binary image scrambling/permutation algorithm exerting on plaintext of size M � (8N), this paper proposes a novel optimal method to break it with some known/chosen-plaintexts. The spatial complexity and computational complexity of the attack are only O(32 � MN) and O(16 � n0 � MN) respectively, where n0 is the number of known/chosen-plaintexts used. The method can be easily