Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks

  • Authors:
  • Chengqing Li;Kwok-Tung Lo

  • Affiliations:
  • College of Information Engineering, Xiangtan University, Xiangtan 411105, Hunan, China and Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hong Kong;Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hong Kong

  • Venue:
  • Signal Processing
  • Year:
  • 2011

Quantified Score

Hi-index 0.08

Visualization

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 Mx(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.n"0.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 MxN and with L different levels of values. The corresponding spatial complexity and computational complexity are only O(MN) and O(@?log"L(MN)@?.MN) respectively. In addition, some specific remarks on the performance of the image scrambling encryption algorithm are presented.