Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32213
Title: Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
Authors: Li, C
Lo, KT 
Keywords: Chosen-plaintext attack
Cryptanalysis
Encryption
Image
Known-plaintext attack
Issue Date: 2011
Publisher: Elsevier
Source: Signal processing, 2011, v. 91, no. 4, p. 949-954 How to cite?
Journal: Signal processing 
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×(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·n0·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×N and with L different levels of values. The corresponding spatial complexity and computational complexity are only O(MN) and O(logL(MN)⌉·MN) respectively. In addition, some specific remarks on the performance of the image scrambling encryption algorithm are presented.
URI: http://hdl.handle.net/10397/32213
ISSN: 0165-1684
EISSN: 1872-7557
DOI: 10.1016/j.sigpro.2010.09.014
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

89
Last Week
0
Last month
1
Citations as of Aug 18, 2017

WEB OF SCIENCETM
Citations

81
Last Week
0
Last month
2
Citations as of Aug 13, 2017

Page view(s)

29
Last Week
4
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.