Efficient hierarchical chaotic image encryption algorithm and its VLSI realisation

Yen, Jui-Cheng; Guo, Jiun-In

doi:10.1049/ip-vis:20000208

Cited by 115 publications

(54 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• SCAN language based methods [16-19, 32, 33]: define some different scan patterns of the 2-D plaintext and combine these patterns to obtain a permutation matrix by scanning the whole plaintext particle by particle; • quadtree based methods [18,19]: divide the plaintext into multi-level quadtree and shuffle the order of four nodes in each level to realize a permutation matrix; • 2-D chaotic maps based methods [34][35][36]: iterate a discretized 2-D chaotic map over the M × N plaintext for many times to realize a permutation matrix; • Fractal curves based methods [14,15]: use a fractal(-like) curve to replace the normal scan order to realize a permutation matrix; • pseudo-random rotations based methods [20,23]: pseudo-randomly rotate particles along some straight lines for many times to realize a permutation matrix; • matrix transformation based methods [21]: use (integer) transformations of matrix, such as n-dimensional Arnold transformation and Fibonacci-Q transformation, to define permutation matrices; • composite methods [22]: combine different methods to realize more complicated permutation matrices.…”

Section: A General Model Of Permutation-only Multimedia Ciphersmentioning

confidence: 99%

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

Chen

et al. 2008

Signal Processing: Image Communication

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: A General Model Of Permutation-only Multimedia Ciphersmentioning

confidence: 99%

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

Chen

et al. 2008

Signal Processing: Image Communication

219

150

View full text Add to dashboard Cite

show abstract

“…With the properties of sensitivity to initial conditions and control parameters, pseudo-randomness and ergodicity, chaotic maps have been widely used in data encryption recently [1][2][3][4][5][6][7][8]. Compared with traditional cryptosystems [9], the ones based on chaos are easier to be realized, which makes it more suitable for large-scale data encryption such as images, videos or audio data.…”

Section: Introductionmentioning

confidence: 99%

Security analysis of a chaos-based image encryption algorithm

Lian

Sun

Wang

2005

Physica A: Statistical Mechanics and its Applications

160

View full text Add to dashboard Cite

show abstract

“…In [23] and [24], there are a number of permutation-based image methods used. The original image should be in uncompressed format and each pixel have a gray value which may be between 0 and 255 , and that can be represented by 8 bits.…”

Section: Image Encryptionmentioning

confidence: 99%

“…Some algorithms for compressing encrypted data and demonstrate blind compression of encrypted video are presented in [21]. In the encryption domain, the signal processing using homomorphic calculation is discussed in [22] and [23].…”

Section: Introductionmentioning

confidence: 99%

An Evaluation on Irretrievable Compression of Encrypted Image

Porkumaran¹,

Manimurugan²,

Mathew³

2012

IJCA

View full text Add to dashboard Cite

This paper may deals with the diverse troubles that may be occurs during the irretrievable compression applied on an encrypted image. This work is a relative learn with different methods of irretrievable compression such as Compressive sensing technique and Iterative reconstruction technique on encrypted image. But they practiced a variety of limitations. The major obscurity is to attain a higher compression ratio as well as the better quality of the reconstructed image. The higher compression ratio and the smoother the original image may supply the better quality of the reconstructed image.

show abstract

Efficient hierarchical chaotic image encryption algorithm and its VLSI realisation

Cited by 115 publications

References 7 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

Security analysis of a chaos-based image encryption algorithm

An Evaluation on Irretrievable Compression of Encrypted Image

Contact Info

Product

Resources

About