A novel bit-level color image encryption using improved 1D chaotic map

Pak, Chanil; An, Kwangil; Jang, Paeksan; Kim, Jonggun; Kim, Sok

doi:10.1007/s11042-018-6739-1

Cited by 116 publications

(58 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since Matthews [8] published his first chaotic theory-based encryption algorithm in 1989, many image encryption algorithms based on chaos theory have been published. In [9], the author proposes a bit-level encryption system based on one-dimensional chaos theory, which converts the pixel values of images into binary, and uses a Logistic map to generate chaotic sequences to scramble and encrypt them. In [10], chaotic sequence generated by Logistic map was used to scramble pixel positions of the segmented images, so as to achieve the purpose of image encryption.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Algorithm Based on Logistic and Two-Dimensional Lorenz

Liang

2020

IEEE Access

View full text Add to dashboard Cite

In recent years, experts and scholars in the field of information security have attached great importance to the security of image information. They have proposed many image encryption algorithms with higher security. In order to further improve the security level of image encryption algorithm, this paper proposes a new image encryption algorithm based on two-dimensional Lorenz and Logistic. The encryption test of several classic images proves that the algorithm has high security and strong robustness. This paper also analyzes the security of encryption algorithms, such as analysis of the histogram, entropy process of information, examination of correlation, differential attack, key sensitivity test, secret key space analysis, noise attacks, contrast analysis. By comparing the image encryption algorithm proposed in this paper with some existing image encryption algorithms, the encryption algorithm has the characteristics of large secret key space, sensitivity to the key, small correlation coefficient and high contrast. In addition, the encryption algorithm is used. It can also resist noise attacks.

show abstract

Section: Introductionmentioning

confidence: 99%

Image Encryption Algorithm Based on Logistic and Two-Dimensional Lorenz

Liang

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…In [37], the original encryption algorithm adopts the permutation encryption-diffusion encryption-linear transform three-stage structure. It consists of secret key selection, bitplane decomposition, permutation encryption, diffusion encryption, linear transform, and bit-plane composition, as shown in Figure 1.…”

Section: Description Of the Original Encryption Algorithmmentioning

confidence: 99%

“…is paper re-evaluates the security of a bit-level image encryption algorithm based on the 1D chaotic map proposed in [37]. e algorithm adopts a permutation encryptiondiffusion encryption-linear transform structure.…”

Section: Introductionmentioning

confidence: 99%

“…(2) e generated chaotic sequence is independent of the plaintext image (3) ere is no ciphertext feedback mechanism in the algorithm Based on the aforementioned security vulnerabilities, the equivalent permutation encryption-equivalent diffusion encryption parts of the image chaotic encryption algorithm proposed in [37] can be cracked separately by the divideand-conquer strategy. Furthermore, the equivalent diffusion key and the equivalent permutation key can be obtained by chosen-plaintext attack.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

Zhang

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In this paper, the security analysis of a bit-level image chaotic encryption algorithm based on the 1D chaotic map is proposed. The original image chaotic encryption algorithm includes bit-level permutation encryption, diffusion encryption, and linear transform. Deciphering of it can be divided into two stages. First, bit-level permutation encryption, diffusion encryption, and linear transform can be simplified into bit-level equivalent permutation encryption and equivalent diffusion encryption, which is a key breakthrough point of cryptanalysis. Second, the chaotic sequence generated by this algorithm is independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be obtained by chosen-plaintext attack, respectively. Theoretical analysis and numerical simulation experiment results verify the effectiveness of the analytical method. Finally, some suggestions are proposed to promote the security of the original image chaotic encryption algorithm.

show abstract

“…Researchers have improved the single chaotic map or combined multiple chaotic maps to improve chaotic properties, producing larger secret key spaces and more random chaotic sequences. Pak et al [3] proposed a structure to modify two same chaotic maps to produce better performance than a single map [11][12][13][14]. Li et al [15] improved the logistic map using linear delay.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Algorithm Based on Tent Delay-Sine Cascade with Logistic Map

Zhang

Ding

2020

Symmetry

View full text Add to dashboard Cite

We propose a new chaotic map combined with delay and cascade, called tent delay-sine cascade with logistic map (TDSCL). Compared with the original one-dimensional simple map, the proposed map has increased initial value sensitivity and internal randomness and a larger chaotic parameter interval. The chaotic sequence generated by TDSCL has pseudo-randomness and is suitable for image encryption. Based on this chaotic map, we propose an image encryption algorithm with a symmetric structure, which can achieve confusion and diffusion at the same time. Simulation results show that after encryption using the proposed algorithm, the entropy of the cipher is extremely close to the ideal value of eight, and the correlation coefficients between the pixels are lower than 0.01, thus the algorithm can resist statistical attacks. Moreover, the number of pixel change rate (NPCR) and the unified average changing intensity (UACI) of the proposed algorithm are very close to the ideal value, which indicates that it can efficiently resist chosen-plain text attack.

show abstract

A novel bit-level color image encryption using improved 1D chaotic map

Cited by 116 publications

References 22 publications

Image Encryption Algorithm Based on Logistic and Two-Dimensional Lorenz

Image Encryption Algorithm Based on Logistic and Two-Dimensional Lorenz

On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

Image Encryption Algorithm Based on Tent Delay-Sine Cascade with Logistic Map

Contact Info

Product

Resources

About