Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
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 M×(8 N), 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
- Publication:
-
Signal Processing
- Pub Date:
- January 2011
- DOI:
- 10.1016/j.sigpro.2010.09.014
- arXiv:
- arXiv:0912.1918
- Bibcode:
- 2011SigPr..91..949L
- Keywords:
-
- Cryptanalysis;
- Known-plaintext attack;
- Chosen-plaintext attack;
- Encryption;
- Image;
- Computer Science - Cryptography and Security
- E-Print:
- 11 pages, 6 figures