Chaos-Based Encryption for Digital Images and Videos

Li, Shujun; Chen, Guanrong; Zheng, Xuan

doi:10.1201/9781420038262.ch4

Cited by 62 publications

(51 citation statements)

References 97 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Meanwhile, many cryptanalytic results have been reported, leading to the conclusion that a number of multimedia encryption schemes are insecure from the cryptographical point of view. For recent surveys on image and video encryption algorithms, see [3][4][5][6][7], and for surveys on speech encryption, see [6,[8][9][10].…”

Section: Introductionmentioning

confidence: 99%

A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks

Chen

et al. 2008

Signal Processing: Image Communication

Self Cite

219

150

View full text Add to dashboard Cite

In recent years secret permutations have been widely used for protecting different types of multimedia data, including speech files, digital images and videos. Based on a general model of permutation-only multimedia ciphers, this paper performs a quantitative cryptanalysis on the performance of these kind of ciphers against plaintext attacks. When the plaintext is of size M × N and with L different levels of values, the following quantitative cryptanalytic findings have been concluded under the assumption of a uniform distribution of each element in the plaintext: 1) all permutation-only multimedia ciphers are practically insecure against known/chosen-plaintext attacks in the sense that only O (log L (M N )) known/chosen plaintexts are sufficient to recover not less than (in an average sense) half elements of the plaintext; 2) the computational complexity of the known/chosen-plaintext attack is only O(n · (M N ) 2 ), where n is the number of known/chosen plaintexts used. When the plaintext has a non-uniform distribution, the number of required plaintexts and the computational complexity is also discussed. to demonstrate the real performance of the known-plaintext attack for a typical permutation-only image cipher.

show abstract

Section: Introductionmentioning

confidence: 99%

A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks

Chen

et al. 2008

Signal Processing: Image Communication

Self Cite

219

150

View full text Add to dashboard Cite

show abstract

“…Encrypting only parts of the image data must be sufficient to satisfy the needed security [8,9]. There are two basic ways to encrypt digital images: in the spatial domain or in the transform domain [10]. Since wavelet based compression appeared and was adopted in the JPEG2000 standard, suggestions for image encryption techniques based in the wavelet domain have been abundant.…”

Section: Introductionmentioning

confidence: 99%

Selective Image Encryption Using DCT with AES Cipher

Belazi¹,

Benrhouma²,

Hermassi³

et al. 2014

Computer Science &Amp; Information Technology ( CS &Amp; IT )

View full text Add to dashboard Cite

show abstract

“…The image encryption methods which are based on chaotic systems attract attention due to their effectiveness for digital multimedia encryption whilst exhibiting the required enhanced sensitivity to initial conditions and system parameters (ergodicity and mixing) [1][2][3][4]. Most of the existing chaotic cryptosystems are based on the pixels permutation and the use of the XOR logical function for bit substitution [5][6][7][8][9][10][11]. In the Xiang [12] algorithm for example, blocks of bits are circularly shifted and the number of bits to be shifted is randomly determined by the chaotic value obtained from a logistic map after 70 iterations.…”

Section: Introductionmentioning

confidence: 99%

Efficient Cryptosystem Based on Chaotic Sequences Sorting

Fouda¹,

Effa²,

Bodo³

et al. 2012

AJSP

View full text Add to dashboard Cite

It is commonly known that mathematical representation of chaotic systems can be used as good candidates for information security. In this paper, we propose an image encryption algorithm based on the use of chaotic sequences sorted by ascending or descending order. The permutation key is defined as a distribution of indices derived from the sorting. This method allows us to easily achieve high performance of pseudorandom permutation through any type of chaotic systems using the true precision of the computer; high-speed encryption algorithm which could meet one of the multimedia encryption specific requirements such as the real-time constraint and high robustness against statistical cryptanalysis. The efficiency of the proposed algorithm is studied in the cases of the piecewise linear chaotic map (PWLCM) and the hyperchaotic Lorenz system. Statistical analyses of the simulation results confirm a high security level of the proposed cipher.

show abstract

Chaos-Based Encryption for Digital Images and Videos

Cited by 62 publications

References 97 publications

A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks

A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks

Selective Image Encryption Using DCT with AES Cipher

Efficient Cryptosystem Based on Chaotic Sequences Sorting

Contact Info

Product

Resources

About