Security analysis of a binary image permutation scheme based on Logistic map

Details Security analysis of a binary image permutation scheme based on Logistic map Security analysis of a binary image permutation scheme based on Logistic map

2009-12-10

arxiv.org/abs/0912.1918v2

Computer Science

Cryptography and Security

10 pages, 6 figures

Scientific paper

In [\textit{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\times (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\cdot MN)$ and $O(16\cdot n_0\cdot MN)$ respectively, where $n_0$ is the number of known/chosen-plaintexts used. The method can be easily extended to break any permutation-only encryption scheme exerting on plaintext of size $M\times N$ and with $L$ different levels of values. The corresponding spatial complexity and computational complexity are only $O(MN)$ and $O(n_0\cdot MN)$ respectively. In addition, some specific remarks on the performance of the image scrambling encryption algorithm are presented.

Affiliated with

Also associated with

No associations

Rating

Security analysis of a binary image permutation scheme based on Logistic map does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Security analysis of a binary image permutation scheme based on Logistic map, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Security analysis of a binary image permutation scheme based on Logistic map will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-594298