S-Box Design Based on 2D Multiple Collapse Chaotic Map and Their Application in Image Encryption

As an essential part of an encryption system, the performance of a chaotic map is critical for system security. However, there are many defects for the existing chaotic maps. The low-dimension (LD) ones are easily predicted and are vulnerable to be attacked, while high-dimension (HD) ones have a low iteration speed. In this paper, a 2D multiple collapse chaotic map (2D-MCCM) was designed, which had a wide chaos interval, a high complexity, and a high iteration speed. Then, a new chaotic S-box was constructed based on 2D-MCCM, and a diffusion method was designed based on the S-box, which improved security and efficiency. Based on these, a new image encryption algorithm was proposed. Performance analysis showed that the encryption algorithm had high security to resist all kinds of attacks easily.

Download Full-text

Image Encryption Algorithm Based on DNA Encoding and Chaotic Maps

Mathematical Problems in Engineering ◽

10.1155/2014/917147 ◽

2014 ◽

Vol 2014 ◽

pp. 1-10 ◽

Cited By ~ 52

Author(s):

Jian Zhang ◽

DongXin Fang ◽

Honge Ren

Keyword(s):

Image Encryption ◽

Dna Sequences ◽

Random Number ◽

Chaotic Maps ◽

Chaotic Map ◽

Security Analysis ◽

Encryption Algorithm ◽

Dna Encoding ◽

Before And After ◽

Image Encryption Algorithm

We propose a new image encryption algorithm based on DNA sequences combined with chaotic maps. This algorithm has two innovations: (1) it diffuses the pixels by transforming the nucleotides into corresponding base pairs a random number of times and (2) it confuses the pixels by a chaotic index based on a chaotic map. For any size of the original grayscale image, the rows and columns are fist exchanged by the arrays generated by a logistic chaotic map. Secondly, each pixel that has been confused is encoded into four nucleotides according to the DNA coding. Thirdly, each nucleotide is transformed into the corresponding base pair a random number of time(s) by a series of iterative computations based on Chebyshev’s chaotic map. Experimental results indicate that the key account of this algorithm is 1.536 × 10127, the correlation coefficient of a 256 × 256 Lena image between, before, and after the encryption processes was 0.0028, and the information entropy of the encrypted image was 7.9854. These simulation results and security analysis show that the proposed algorithm not only has good encryption effect, but also has the ability to repel exhaustive, statistical, differential, and noise attacks.

Download Full-text

A New One-Dimensional Compound Chaotic System and Its Application in High-Speed Image Encryption

Applied Sciences ◽

10.3390/app112311206 ◽

2021 ◽

Vol 11 (23) ◽

pp. 11206

Author(s):

Shenli Zhu ◽

Xiaoheng Deng ◽

Wendong Zhang ◽

Congxu Zhu

Keyword(s):

Image Encryption ◽

Chaotic System ◽

High Speed ◽

Chaotic Maps ◽

Chaotic Map ◽

Logistic Map ◽

Encryption Algorithm ◽

Network Communication ◽

One Dimensional ◽

Image Encryption Algorithm

In the edge computing and network communication environment, important image data need to be transmitted and stored securely. Under the condition of limited computing resources, it is particularly necessary to design effective and fast image encryption algorithms. One-dimensional (1D) chaotic maps provide an effective solution for real-time image encryption, but most 1D chaotic maps have only one parameter and a narrow chaotic interval, which has the disadvantage of security. In this paper, a new compound 1D chaotic map composed of a logistic map and tent map is proposed. The new system has two system parameters and an arbitrarily large chaotic parameter interval, and its chaotic signal is evenly distributed in the whole value space so it can improve the security in the application of information encryption. Furthermore, based on the new chaotic system, a fast image encryption algorithm is proposed. The algorithm takes the image row (column) as the cyclic encryption unit, and the time overhead is greatly reduced compared with the algorithm taking the pixel as the encryption unit. In addition, the mechanism of intermediate key associated with image content is introduced to improve the ability of the algorithm to resist chosen-plaintext attack and differential attack. Experiments show that the proposed image encryption algorithm has obvious speed advantages and good cryptographic performance, showing its excellent application potential in secure network communication.

Download Full-text

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

Engineering and Technology Journal ◽

10.30684/etj.v38i3b.433 ◽

2020 ◽

Vol 38 (3B) ◽

pp. 98-103

Author(s):

Atyaf S. Hamad ◽

Alaa K. Farhan

Keyword(s):

Image Encryption ◽

Chaotic Map ◽

Logistic Map ◽

Encryption Algorithm ◽

Second Phase ◽

Cipher Text ◽

The Face ◽

Substitution Principle ◽

2D Logistic Map ◽

Image Encryption Algorithm

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.

Download Full-text