A differential cryptanalysis of Yen–Chen–Wu multimedia cryptography system

Li, Chengqing; Li, Shujun; Lo, Kwok-Tung; Kyamakya, Kyandoghere

doi:10.1016/j.jss.2010.02.039

Cited by 9 publications

(4 citation statements)

References 35 publications

(121 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Differential cryptanalysis [43] is another effective method to decipher ciphertext. This method is to find the plaintext pairs and corresponding ciphertext pairs having the same differentials.…”

Section: Differential Probabilitymentioning

confidence: 99%

A Novel S-Box Design Algorithm Based on a New Compound Chaotic System

Zhu

Wang

2019

Entropy

View full text Add to dashboard Cite

Substitution-boxes (S-Boxes) are important non-linear components in block cryptosystem, which play an important role in the security of cryptosystems. Constructing S-Boxes with a strong cryptographic feature is an important step in designing block cipher systems. In this paper, a novel algorithm for constructing S-Boxes based on a new compound chaotic system is presented. Firstly, the new chaotic system, tent–logistic system, is proposed, which has better chaotic performance and wider chaotic range than the tent and logistic system, and can not only increase the randomness of the chaotic sequences but also expand the key space of cryptosystems. Secondly, a novel linear mapping is employed to construct the initial S-Box. Then, the permutation operation on the initial S-Box is performed by using chaotic sequence generated with the tent–logistic system, which improves the cryptographic features of the S-Box. The idea behind the proposed work is to make supplementary safe S-box. Detail tests for cryptographic strength of the proposed S-Box are performed by using different standard benchmarks. The test results and performance analysis show that our proposed S-Box has very smaller values of linear probability (LP) and differential probability (DP) and a satisfactory average value of nonlinearity compared with other S-Boxes, showing its excellent application potential in block cipher system.

show abstract

Section: Differential Probabilitymentioning

confidence: 99%

A Novel S-Box Design Algorithm Based on a New Compound Chaotic System

Zhu

Wang

2019

Entropy

View full text Add to dashboard Cite

show abstract

“…As the 1 + M S M • N S N permutation relationship matrices of HCIE are uniquely determined by the bit sequence {b(i)} L b −1 i=0 and the public parameters, one may recover reversely some consecutive bits of {b(i)} L b −1 i=0 [26,Sec. 3.3.6].…”

Section: Chosen-plaintext Attackmentioning

confidence: 99%

Cracking a hierarchical chaotic image encryption algorithm based on permutation

2016

Signal Processing

Self Cite

163

View full text Add to dashboard Cite

In year 2000, an efficient hierarchical chaotic image encryption (HCIE) algorithm was proposed, which divides a plain-image of size M×N with T possible value levels into K blocks of the same size and then operates position permutation on two levels: intra-block and inter-block. As a typical position permutation-only encryption algorithm, it has received intensive attention. The present paper analyzes specific security performance of HCIE against ciphertext-only attack and known/chosen-plaintext attack. It is found that only O( log T (M ·N/K) ) known/chosen plain-images are sufficient to achieve a good performance, and the computational complexity is O(M · N · log T (M · N/K) ), which effectively demonstrates that hierarchical permutationonly image encryption algorithms are less secure than normal (i.e., non-hierarchical) ones. Detailed experiment results are given to verify the feasibility of the known-plaintext attack. In addition, it is pointed out that the security of HCIE against ciphertext-only attack was much overestimated.

show abstract

“…• generating pseudo-random bit sequence, which is then used to control combination and composition of some basic arithmetical operations like modulo addition and exclusive or operation [6,7,8,9,10,11,12,4].…”

Section: Introductionmentioning

confidence: 99%

“…Comparison between IEAS and DES in terms of complexity of encrypting 128 plain-bits and robustness against differential attack, where CP and KP denote chosen plaintexts and known plaintexts, respectively 12. ) O(2 15 ) 2 44 KP 14KP 10% 100% 13 O(2 12 ) O(2 15 ) 2 45 KP 14KP 10% 100% 16 O(2 13 ) O(2 16 ) 2 50 KP 14KP 51.3% 100%…”

mentioning

confidence: 99%

Cryptanalyzing a chaos-based image encryption algorithm using alternate structure

Zhang

Wong

et al. 2012

Journal of Systems and Software

Self Cite

View full text Add to dashboard Cite

Recently, a chaos-based image encryption algorithm using alternate structure (IEAS) was proposed. This paper focuses on differential cryptanalysis of the algorithm and finds that some properties of IEAS can support a differential attack to recover equivalent secret key with a little small number of known plain-images. Detailed approaches of the cryptanalysis for cryptanalyzing IEAS of the lower round number are presented and the breaking method can be extended to the case of higher round number. Both theoretical analysis and experiment results are provided to support vulnerability of IEAS against differential attack. In addition, some other security defects of IEAS, including insensitivity with respect to changes of plain-images and insufficient size of key space, are also reported.

show abstract

A differential cryptanalysis of Yen–Chen–Wu multimedia cryptography system

Cited by 9 publications

References 35 publications

A Novel S-Box Design Algorithm Based on a New Compound Chaotic System

A Novel S-Box Design Algorithm Based on a New Compound Chaotic System

Cracking a hierarchical chaotic image encryption algorithm based on permutation

Cryptanalyzing a chaos-based image encryption algorithm using alternate structure

Contact Info

Product

Resources

About