scispace - formally typeset
Search or ask a question
Journal ArticleDOI

A new image encryption algorithm based on hyper-chaos

21 Jan 2008-Physics Letters A (North-Holland)-Vol. 372, Iss: 4, pp 394-400
TL;DR: The experimental results demonstrate that the suggested encryption algorithm of image has the advantages of large key space and high security, and moreover, the distribution of grey values of the encrypted y image has a random-like behavior.
About: This article is published in Physics Letters A.The article was published on 2008-01-21. It has received 584 citations till now. The article focuses on the topics: Probabilistic encryption & Encryption.
Citations
More filters
Journal ArticleDOI
TL;DR: Simulation results show that the proposed algorithm can encrypt colour image effectively and resist various typical attacks.

633 citations


Cites methods from "A new image encryption algorithm ba..."

  • ...In recent years, some chaos-based image encryption algorithms have been developed [2–10], including algorithms for grey-level image [2–6] and algorithms for colour image [7–10]....

    [...]

Journal ArticleDOI
TL;DR: The proposed local Shannon entropy measure overcomes several weaknesses of the conventional global Shannon entropyMeasure, including unfair randomness comparisons between images of different sizes, failure to discern image randomness before and after image shuffling, and possible inaccurate scores for synthesized images.

476 citations


Cites background from "A new image encryption algorithm ba..."

  • ...not good for image data either for a low encryption eciency [39] or a relatively small block size for encryption. Many image ciphers have been researced, including chaotic system based image ciphers [7, 10, 13, 15, 18, 19, 23, 25, 27, 35, 36, 41, 42], SCAN language based algorithms [11, 12], transform based algorithms [24, 31, 38] and others [22]. On the other hand, the distinctive characteristics of image data implies that the randomness tests d...

    [...]

Journal ArticleDOI
Lu Xu1, Zhi Li1, Jian Li1, Wei Hua1
TL;DR: A novel bit-level image encryption algorithm that is based on piecewise linear chaotic maps (PWLCM) that is both secure and reliable for image encryption.

449 citations

Journal ArticleDOI
TL;DR: Experimental results and theoretical analysis show that the scheme is able to resist various attacks, so it has extraordinarily high security.

417 citations

Journal ArticleDOI
TL;DR: A new block image encryption scheme based on hybrid chaotic maps and dynamic random growth technique, which can completely eliminate the cyclical phenomenon and resist chosen plaintext attack is proposed.

379 citations


Additional excerpts

  • ...Some proposed image encryption schemes only do XOR operation on the original or scrambling images [5–8]....

    [...]

References
More filters
Book
10 Nov 1993
TL;DR: This document describes the construction of protocols and their use in the real world, as well as some examples of protocols used in the virtual world.
Abstract: CRYPTOGRAPHIC PROTOCOLS. Protocol Building Blocks. Basic Protocols. Intermediate Protocols. Advanced Protocols. Esoteric Protocols. CRYPTOGRAPHIC TECHNIQUES. Key Length. Key Management. Algorithm Types and Modes. Using Algorithms. CRYPTOGRAPHIC ALGORITHMS. Data Encryption Standard (DES). Other Block Ciphers. Other Stream Ciphers and Real Random-Sequence Generators. Public-Key Algorithms. Special Algorithms for Protocols. THE REAL WORLD. Example Implementations. Politics. SOURCE CODE.source Code. References.

3,432 citations

Journal ArticleDOI
TL;DR: The two-dimensional chaotic cat map is generalized to 3D for designing a real-time secure symmetric encryption scheme that uses the 3D cat map to shuffle the positions of image pixels and uses another chaotic map to confuse the relationship between the cipher-image and the plain-image, thereby significantly increasing the resistance to statistical and differential attacks.
Abstract: Encryption of images is different from that of texts due to some intrinsic features of images such as bulk data capacity and high redundancy, which are generally difficult to handle by traditional methods. Due to the exceptionally desirable properties of mixing and sensitivity to initial conditions and parameters of chaotic maps, chaos-based encryption has suggested a new and efficient way to deal with the intractable problem of fast and highly secure image encryption. In this paper, the two-dimensional chaotic cat map is generalized to 3D for designing a real-time secure symmetric encryption scheme. This new scheme employs the 3D cat map to shuffle the positions (and, if desired, grey values as well) of image pixels and uses another chaotic map to confuse the relationship between the cipher-image and the plain-image, thereby significantly increasing the resistance to statistical and differential attacks. Thorough experimental tests are carried out with detailed analysis, demonstrating the high security and fast encryption speed of the new scheme.

1,904 citations

Journal ArticleDOI
TL;DR: Methods are shown how to adapt invertible two-dimensional chaotic maps on a torus or on a square to create new symmetric block encryption schemes to encrypt an N×N image.
Abstract: In this paper, methods are shown how to adapt invertible two-dimensional chaotic maps on a torus or on a square to create new symmetric block encryption schemes. A chaotic map is first generalized by introducing parameters and then discretized to a finite square lattice of points which represent pixels or some other data items. Although the discretized map is a permutation and thus cannot be chaotic, it shares certain properties with its continuous counterpart as long as the number of iterations remains small. The discretized map is further extended to three dimensions and composed with a simple diffusion mechanism. As a result, a symmetric block product encryption scheme is obtained. To encrypt an N×N image, the ciphering map is iteratively applied to the image. The construction of the cipher and its security is explained with the two-dimensional Baker map. It is shown that the permutations induced by the Baker map behave as typical random permutations. Computer simulations indicate that the cipher has g...

1,654 citations

Book
24 Nov 1995

979 citations


"A new image encryption algorithm ba..." refers background in this paper

  • ...It is well known that a good encryption algorithm should be sensitive to the cipher keys, and the key space should be large enough to make brute-force attacks infeasible [12]....

    [...]

Journal ArticleDOI
TL;DR: This paper derives a “chaotic” function, and shows that it may be suitable for cryptographic use, in particular as a replacement for the one-time pad system.
Abstract: Under certain conditions, even simple non-linear iterative functions are capable of generating “chaotic” sequences of random numbers. In this paper we derive such a “chaotic” function, and show that it may be suitable for cryptographic use, in particular as a replacement for the one-time pad system.

875 citations