A new color image encryption using combination of the 1D chaotic map

Pak, Chanil; Huang, Ling

doi:10.1016/j.sigpro.2017.03.011

Cited by 535 publications

(302 citation statements)

References 27 publications

Supporting

Mentioning

288

Contrasting

Order By: Relevance

“…Hua Chen et al used a hyperchaos-based image encryption algorithm [15]. L.Huang et al proposed a difference of the output sequences of two same existing 1D chaotic maps [16].…”

Section: Literature Reviewmentioning

confidence: 99%

An Efficient Image Encryption Algorithm for the Period of Arnold s CAT Map

Elmacı

Catak

2018

ijisae

View full text Add to dashboard Cite

Arnold's CAT Map (ACM) is a chaotic transformation of the 2-dimensional toral automorphism T 2 defined by the mapping Γ ∶ T 2 → T 2 . There are many applications of ACM in various research areas such as: steganography, encryption of images, texts and watermarks. The transformation of an image is achieved by the randomized order of pixels. After a finite number of repetitions of the transformation, the original image reappears. In this study, encryption of two images is demonstrated together with a proposed algorithm. Moreover, the periodicity of ACM is discussed and an algorithm to change the period of ACM is suggested. The resultant period obtained from the new algorithm is compared with the period obtained from the usual ACM. The results show that the period of the proposed algorithm grows exponentially while the period of ACM has an upper bound.

show abstract

“…Hua Chen et al used a hyperchaos-based image encryption algorithm [15]. L.Huang et al proposed a difference of the output sequences of two same existing 1D chaotic maps [16].…”

Section: Literature Reviewmentioning

confidence: 99%

An Efficient Image Encryption Algorithm for the Period of Arnold s CAT Map

Elmacı

Catak

2018

ijisae

View full text Add to dashboard Cite

show abstract

“…In [32], the security analysis of a Latin square based image chaotic encryption algorithm proposed in [22] is given to find the security vulnerabilities both in the diffusion stage and in the scrambling stage through chosen text attack. In [33], the chosen plaintext attack is adopted for the safety performance assessment of a 1D combinatorial chaotic encryption algorithm proposed in [34]. In addition, in [35], the chosen plaintext attack is also utilized for analyzing the security of a bit cube-based image chaotic encryption algorithm proposed in [36].…”

Section: Introductionmentioning

confidence: 99%

On the Security of a Latin-Bit Cube-Based Image Chaotic Encryption Algorithm

Zhang

2019

Entropy

View full text Add to dashboard Cite

In this paper, the security analysis of an image chaotic encryption algorithm based on Latin cubes and bit cubes is given. The proposed algorithm adopts a first-scrambling-diffusion- second-scrambling three-stage encryption scheme. First, a finite field is constructed using chaotic sequences. Then, the Latin cubes are generated from finite field operation and used for image chaotic encryption. In addition, according to the statistical characteristics of the diffusion image in the diffusion stage, the algorithm also uses different Latin cube combinations to scramble the diffusion image for the second time. However, the generation of Latin cubes in this algorithm is independent of plain image, while, in the diffusion stage, when any one bit in the plain image changes, the corresponding number of bits in the cipher image follows the change with obvious regularity. Thus, the equivalent secret keys can be obtained by chosen plaintext attack. Theoretical analysis and experimental results indicate that only a maximum of 2 . 5 × w × h 3 + 6 plain images are needed to crack the cipher image with w × h resolution. The size of equivalent keys deciphered by the method proposed in this paper are much smaller than other general methods of cryptanalysis for similar encryption schemes.

show abstract

“…But the traditional block encryption being widely used now is found to be inefficient for real-time communication. Hence a lot of image encryption methods using chaotic maps with high sensitivity to their initial conditions and system parameter values and simple structures are proposed [1,2].…”

Section: Introductionmentioning

confidence: 99%

Color Image Encryption In The Spatial Domain Using 3-D Chaotic System

Alzreghi

Alkishriwo

2018

Proceedings of First Conference for Engineering Sciences and Technology: Vol. 1

View full text Add to dashboard Cite

A B S T R A C TUsers of Internet daily send and receive many images through social media. These images are vulnerable to hack by attackers. Therefore, it is necessary to develop methods to protect these images against attackers. A nontraditional encryption method for encrypting color images in the spatial domain is proposed. The main idea in this work is based on building strong encryption algorithm through implementing the permutation and diffusion operations on the pixels, where every pixel composed of three values red, green and blue. These operations are implemented depending on extracting three chaotic sequences from the 3-D chaotic system, where each chaotic sequence is used to shuffle and diffuse each color in the plaintext image. The proposed system is tested on wellknown images like Lena and Mandrill. Experiments and security analysis prove that the algorithm has an excellent performance in image encryption.

show abstract

A new color image encryption using combination of the 1D chaotic map

Cited by 535 publications

References 27 publications

An Efficient Image Encryption Algorithm for the Period of Arnold s CAT Map

An Efficient Image Encryption Algorithm for the Period of Arnold s CAT Map

On the Security of a Latin-Bit Cube-Based Image Chaotic Encryption Algorithm

Color Image Encryption In The Spatial Domain Using 3-D Chaotic System

Contact Info

Product

Resources

About