2011
DOI: 10.1016/j.sigpro.2010.09.014
|View full text |Cite
|
Sign up to set email alerts
|

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 × (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 · M N ) and O(16 · n 0 · M N ) respectively, where n 0 is the number of known/chosenplaintexts used. The method can be eas… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
123
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 198 publications
(125 citation statements)
references
References 24 publications
2
123
0
Order By: Relevance
“…From this permutation algorithm, an efficient chaos-based block cipher using a chaotic logistic map was proposed [5].HimanKhanzadiet al proposed an algorithm for image encryption using the random bit sequence generator and based on chaotic maps. Chaotic Logistic and Tent maps were used to generate required random bit sequences [6].…”
Section: Related Workmentioning
confidence: 99%
“…From this permutation algorithm, an efficient chaos-based block cipher using a chaotic logistic map was proposed [5].HimanKhanzadiet al proposed an algorithm for image encryption using the random bit sequence generator and based on chaotic maps. Chaotic Logistic and Tent maps were used to generate required random bit sequences [6].…”
Section: Related Workmentioning
confidence: 99%
“…So, the attackers can disclose the relation between the plaintexts and ciphertexts, and even deduce the secret key if the encryption structure is not sufficiently secure. Many successful cryptanalysis cases using the chosen/known plaintext attack were reported in [31][32][33]40]. In the proposed algorithm, special structures are designed to resist the chosen or known plaintext attacks: Firstly, the principle of confusion and diffusion introduced by Shannon are fulfilled.…”
Section: Chosen/known Plaintext Attacks Analysismentioning
confidence: 99%
“…In [27,28], image encryption schemes based on DNA sequence operations rule and some improved chaotic systems were proposed, and an image encryption algorithm based on wave function and chaotic system was given in [29] where keystream was dependent on both the plain image and the secret key. However, some chaos-based image encryptions had been broken [30][31][32][33][34]. According to the Kerckhoff's principle, the security level of cryptographic keys decides the security level of the cipher algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…However, each block in encrypted images has almost the same correlation as that of original images [9], [10]. Several efficient attacks on the permutation-only encryption have been studied [11], [12], but they are not available for the block scrambling-based encryption.…”
Section: Introductionmentioning
confidence: 99%