Image encryption based on 3D Cubic-Sine Logistic Coupled Map and Improved Chirikov Map

A color image encryption and decryption scheme based on extended DNA coding and fractional-order 5D hyper-chaotic system

A novel color image encryption algorithm based on a cross 2D hyperchaotic map is proposed in this paper. The cross 2D hyperchaotic map is constructed using one nonlinear function and two chaotic maps with a cross structure. Chaotic behaviors are illustrated using bifurcation diagrams, Lyapunov exponent spectra, phase portraits, etc. In the color image encryption algorithm, the keys are generated using hash function SHA-512 and the information of the plain color image. First, the color plain image is converted to a combined bit-level matrix and permuted by the chaos-based row and column combined cycle shift scrambling method. Then, the scrambled integer matrix is diffused according to the selecting sequence which depends on the chaotic sequence. Last, decompose the diffusion matrix to get the encrypted color image. Simulation experiments and security evaluations show that the algorithm can encrypt the color image effectively and has good security to resist various kinds of attacks.

This paper proposes a color image encryption algorithm based on a cloud model Fibonacci chaotic system, as well as a matrix convolution operation that can protect image content effectively and safely. The algorithm combines the cloud model with the generalized Fibonacci, creating a new complex chaotic system that realizes the dynamic random variation of chaotic sequences. The chaotic sequence is used to scramble the pixel coordinates of the mosaic images of the R, G, and B components of the color image. Then, the chaotic sequence value is used as a matrix convolution cloud algorithm that alternately updates the input value of the matrix convolution operation and the pixel value to obtain the permutation transformation of the original pixel value. Finally, the pixel values of the replacement and cloud model Fibonacci chaotic sequence and the pixel values of the front (rear) adjacent pixel points are subjected to a two-way exclusive XOR operation. Realizing the change of the arbitrary pixel value causes a chain transformation of the pixel values of all of the pixel points, and sequentially generates an encrypted image. Experiments show that the histogram of the encrypted image is smoother and adjacent pixels of the image have low correlation. In addition, this algorithm can resist attack experiments such as differential attack, select plaintext attack and noise attack and provides high encryption security, high anti-interference, and strong robustness. The dynamic chaotic system is used to realize the color image encryption of the dynamic key, and the encryption algorithm has higher security and the validity of the algorithm.

This paper proposed a secure and fast image encryption algorithm which is composed of permutation and substitution of pixels. In order to eliminate the relation between adjacent pixels in the image sufficiently, firstly, the sequence which derives from Logistic map is sorted as an ascending order, and the transformation function of element's index can be obtained in this process. Secondly, perform XOR operation between the scrambled pixel sequence and another chaotic sequence which derives from Henon map. Experiment simulations show that the proposed algorithm is secure against different types of attacks and can be applied to the real time encryption.

Image encryption based on chaotic maps is an important method for ensuring the secure communication of digital multimedia on the Internet. To improve the encryption performance and security of image encryption systems, a new image encryption algorithm is proposed that employs a compound chaotic map and random cyclic shift. First, a new hybrid chaotic system is designed by coupling logistic, ICMIC, Tent, and Chebyshev (HLITC) maps. Comparison tests with previous chaotic maps in terms of chaotic trajectory, Lyapunov exponent, and approximate entropy illustrate that the new hybrid chaotic map has better chaotic performance. Then, the proposed HLITC chaotic system and spiral transformation are used to develop a new chaotic image encryption scheme using the double permutation strategy. The new HLITC chaotic system is used to generate key sequences used in the image scrambling and diffusion stages. The spiral transformation controlled by the chaotic sequence is used to scramble the pixels of the plaintext image, while the XOR operation based on a chaotic map is used for pixel diffusion. Extensive experiments on statistical analysis, key sensitivity, and key space analysis were conducted. Experimental results show that the proposed encryption scheme has good robustness against brute-force attacks, statistical attacks, and differential attacks and is more effective than many existing chaotic image encryption algorithms.

Image Encryption Algorithm based on Pseudo-random Sequence

Chaos is widely used in secure communication and cryptography due to its randomness, unpredictability, non-periodicity and high sensitivity to initial values and parameters. However, there are many risks in some existing chaotic image encryption algorithms because they use the the chaotic map without complex dynamic characteristics. To overcome these weaknesses, in this paper introduced an improved Hénon map, and the dynamic analysis results show that the improved Hénon map has more rich chaotic behaviors and better complexity. In addition, we designed a color image encryption scheme using the improved Hénon sequences. For this encryption algorithm, color image is divided into R, G, B primary colors, then R, G, B primary colors are scrambled and diffused by the improved Hénon sequences. The simulation results illustrate that color image encryption algorithm security is advanced by usingimproved Hénon map.

Today, social communication through the Internet has become more popular and has become a crucial part of our daily life. Naturally, sending and receiving various data through the Internet has also grown a lot. Keeping important data secure in transit has become a challenge for individuals and even organizations. Therefore, the trinity of confidentiality, integrity, and availability will be essential, and encryption will definitely be one of the best solutions to this problem. Of course, for image data, it will not be possible to use conventional encryption methods for various reasons, such as the redundancy of image data, the strong correlation of adj acent pixels, and the large volume of image data. Therefore, special methods were developed for image encryption. Among the prevalent methods for image encryption is the use of DNA sequences as well as chaos signals. In this paper, a cycling 3D chaotic map and DNA sequences are used to present a new method for color image encryption. Several experimental analyses were performed on the proposed method, and the results proved that the presented method is secure and efficient.

Combined the image encryption and hiding technique, this paper proposed a method of color image protective transmission based on Logistic map and LSB hiding algorithm. Firstly, Logistic map produced three chaotic sequences by one secret-key. Secondly, the image pixel matrixs of R,G,B were permuted by the chaotic sequences and digital image encryption was realized in the space domain. Finally, the encrypted image was embedded in the carrier image by LSB hiding algorithm to transmission. This paper also made qualitative and quantitative analysis of the effects of the project from aspects of operation speed, key sensitivity, anti-attack capability. Experimental results show that the method has advantages of good secrecy, high security and fast operation speed.

A novel devaney chaotic map with uniform trajectory for color image encryption

Multi-wing chaotic systems are highly valued for their complexity and pseudo-randomness, making them promising in applications like secure communication and image encryption. However, existing chaotic systems face limitations in attractor diversity and system dimensions, which restrict their effectiveness in complex encryption applications. In this paper, we construct a four-dimensional multi-wing chaotic system based on the Sprott-A chaotic system by introducing linear feedback control and additional state variables. Furthermore, by incorporating piecewise linear functions and new state variables, a five-dimensional multi-wing chaotic system with the characteristic of odd and even numbers of hidden attractors are developed. Odd multi-wing attractors have centrally symmetric complex trajectories, while even multi-wing attractors possess axisymmetric trajectories through the introduction of offset terms. This system overcomes the limitations of existing chaotic systems and significantly improves complexity, controllability, and pseudo-randomness, making it more suitable for encryption applications. Based on this system, we design a new color image encryption algorithm that uses chaotic sequences for pixel permutation and diffusion operations. The security analysis indicates that the algorithm offers a large key space, high sensitivity to initial conditions, and strong resistance to various attacks, providing a novel solution for complex encryption applications.

Recently, chaotic systems have been widely investigated in several engineering applications. This paper presents a new chaotic system based on Julia’s fractal process, chaotic attractors and Logistic map in a complex set. Complex dynamic characteristics were analyzed, such as equilibrium points, bifurcation, Lyapunov exponents and chaotic behavior of the proposed chaotic system. As we know, one positive Lyapunov exponent proved the chaotic state. Numerical simulation shows a plethora of complex dynamic behaviors, which coexist with an antagonist form mixed of bifurcation and attractor. Then, we introduce an algorithm for image encryption based on chaotic system. The algorithm consists of two main stages: confusion and diffusion. Experimental results have proved that the proposed maps used are more complicated and they have a key space sufficiently large. The proposed image encryption algorithm is compared to other recent image encryption schemes by using different security analysis factors including differential attacks analysis, statistical tests, key space analysis, information entropy test and running time. The results demonstrated that the proposed image encryption scheme has better results in the level of security and speed.

In stream cipher systems, random key sequence generation is the primary task. The concept of chaotic systems can be considered in generating a random key sequence due to its inherent randomness property. Though the chaotic real sequences are random, the randomness will be lost after converting them to binary sequences. In this context, the authors propose a technique which uses a non‐linear feedback system to enhance the randomness of the binary sequences. In this work, three binary chaotic sequences using a logistic map are generated with three different initial conditions and each real value of the chaotic sequence is converted to ‘k’ bit binary value using a thresholding function. Some of the resulting sequences are not random. Hence, in this article a non‐linear structure is used to make the resulting sequence random. Here, a non‐linear function similar to the structure of the Simplified Data Encryption Standard is used to generate a sequence using two non‐random chaotic binary sequences. The resulting sequence is XORed with another non‐random chaotic binary sequence to get a random sequence. Sequences obtained from this nonlinear system are subjected to randomness tests and the results indicate that the sequences pass all the randomness tests. Hence, the sequences qualify as random key sequences, which can be used in a stream cipher based system to encrypt the data samples like audio, image, video, and so forth.

In order to realize the scrambling aim of combination of pixels position substitution and the pixels values change, and moreover, in order to make up this deficiency which the low security of image encryption using one-dimensional chaotic system to encrypt digital image, a digital image encryption algorithm based on bit plane scrambling and multiple chaotic systems combination is proposed. Firstly, we generate integer sequence which as parameters and iteration times of general Arnold map to shuffle the positions of each bit-plane pixels by using 4D hyper-chaotic system. Then we generate random integer vectors to shuffle the positions of the rows and columns for each bit-plane image by using two dimensional Logistic map. Finally, the scrambled gray image is reconstructed from those shuffled bit-plane images. The experiment results demonstrate that the proposed image encryption algorithm has the advantages of large key space and very sensitivity with respect to the secret key and original image. The encryption system possesses perfect confusion properties and it can resist the various attacks. It shows that the proposed scheme is of high security.

This study proposes a fast image encryption method for color images, integrating an autoencoder to compress the image and a 6D hyperchaotic system to ensure enhanced security. Initially, a hash value is obtained from the original color image. The hash value, which serves as the secret key of the proposed encryption method, is used to initialize the state variables of the hyperchaotic system, which produces six distinct pseudo-random sequences. The input image is then compressed into a latent image (lossy) using a Vision Transformer Autoencoder model. This latent image is scrambled using chaotic sequences and a Random Shuffle technique. Diffusion is achieved through the Trifid Cipher transformation, which utilizes the remaining chaotic sequences to manipulate pixel values, thereby yielding a cipher version of the latent image. The suggested technique is faster and significantly enhances security compared to the state-of-the-art methods. This method achieves an average entropy of 7.9986, a correlation coefficient close to zero ≈ 0.00004, and key sensitivity analysis gives NPCR = 99.6110% and UACI = 33.4637%. Moreover, the key space of [Formula: see text] confirms that the proposed scheme offers strong resistance against brute-force attacks.