Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2009 | Clinical Orthopaedics and Related Research | cryptanalysis,encryption,known-plaintext attack,image,chosen-plaintext attack,logistic map,security analysis,binary image,known plaintext attack,computational complexity,pattern recognition |
Field | DocType | Volume |
Discrete mathematics,Scrambling,Computer science,Binary image,Permutation,Algorithm,Logistic map,Theoretical computer science,Encryption,Pixel,Plaintext,Computational complexity theory | Journal | abs/0912.1 |
Citations | PageRank | References |
3 | 0.47 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengqing Li | 1 | 928 | 64.94 |
| Kwok-Tung Lo | 2 | 662 | 66.15 |