Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
arXiv:0912.1918 · doi:10.1016/j.sigpro.2010.09.014
Abstract
Recently, 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 , 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 and respectively, where 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 and with different levels of values. The corresponding spatial complexity and computational complexity are only and respectively. In addition, some specific remarks on the performance of the image scrambling encryption algorithm are presented.
11 pages, 6 figures
References in corpus (4)
Cited by in corpus (11)
- On the cryptanalysis of Fridrich's chaotic image encryption scheme
- Cryptanalyzing an Image-Scrambling Encryption Algorithm of Pixel Bits
- Cracking a hierarchical chaotic image encryption algorithm based on permutation
- A chaotic image encryption scheme owning temp-value feedback
- Cryptanalysis of a one round chaos-based Substitution Permutation Network
- Security measurement of a medical communication scheme based on chaos and DNA coding
- Cryptanalyzing two image encryption algorithms based on a first-order time-delay system
- Cryptanalyzing a class of image encryption schemes based on Chinese Remainder Theorem
- Deciphering a novel image cipher based on mixed transformed Logistic maps
- Design and ARM-embedded implementation of a chaotic map-based multicast scheme for multiuser speech wireless communication
- An optical image encryption scheme based on depth-conversion integral imaging and chaotic maps