Image encryption algorithm based on bit-plane scrambling and multiple chaotic systems combination

Digital images are widely used in many fields, and image security is becoming more and more important. To enhance the security and robustness, this paper proposes an image encryption algorithm based on a new l dimensional chaotic map and double base complementation DNA coding. Firstly, an equation of l dimensional chaotic map is proposed, and two-dimensional equations are chosen as the first choice for encryption. Secondly, a double-base DNA encoding method is proposed to solve the weakness that DNA encoding rules are more vulnerable to brute force attacks. Thirdly, a DNA cube image encryption algorithm on three-dimensional space is designed. Finally, the experiments and performance analyses of the proposed image encryption algorithm are carried out. The key space is notably extensive, approximately 2456, and the information entropy of the encrypted image approaches 8, while the correlation between adjacent pixels is nearly 0. Furthermore, the proposed algorithm demonstrates remarkable resilience against clipping and noise attacks. Consequently, our algorithm is both secure and robust, making it well-suited for image transmission in network environments that demand high levels of security and robustness.

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.

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

The rapid development of digital image transmission technology requires a more secure and effective image encryption scheme to provide the necessary security. This paper introduces an improved sine-transform-based chaotic system (ISTBCS). By linearly weighting and nonlinearly multiplying the selected classic maps, the new chaotic maps with more complex dynamics are obtained through sinusoidal transformation. Performance evaluation shows that it has chaotic characteristics such as wide range of chaos, high complexity, and strong non-periodicity. On this basis, an image encryption algorithm that uses bidirectional pixel encoding, displacement and diffusion at the same time is designed. By pixel encoding the plaintext, the small changes in the ordinary image can be propagated to all the pixels of the encrypted image, which greatly improves the ability to resist known plaintext attacks and selected plaintext attacks. Simulation results and performance analysis show that the algorithm has a large key space, strong key sensitivity, strong performance to make the structural data correlation disappear, and then can increase the entropy, has good anti attack ability, and can effectively meet the needs of image encryption.

Digital image transmission plays a very significant role in information transmission, so it is very important to protect the security of image transmission. Based on the analysis of existing image encryption algorithms, this article proposes a new digital image encryption algorithm based on the splicing model and 1D secondary chaotic system. Step one is the algorithm of this article divides the plain image into four sub-parts by using quaternary coding, and these four sub-parts can be coded separately. Only by acquiring all the sub-parts at one time can the attacker recover the useful plain image. Therefore, the algorithm has high security. Additionally, the image encryption scheme in this article used a 1D quadratic chaotic system, which makes the key space big enough to resist exhaustive attacks. The experimental data show that the image encryption algorithm has high security and a good encryption effect.

A novel image encryption algorithm based on polynomial combination of chaotic maps and dynamic function generation

In this paper, a new image encryption algorithm is proposed by integrating Sine and piecewise linear chaotic maps. In order to realize the effect of encrypted image, the security key and 2D Sine-piecewise linear chaotic map (SPLCM) are used to encrypt the image by using random sequence and random matrix, and then using the replacement operation and the diffusion operation of the original image. The proposed image encryption algorithm is simple and practical, and the simulation results show that this algorithm is able to encrypt different types of digital images into unidentifiable random images. The security analysis also shows that this algorithm has a higher security leve.l

In this paper, a new 4D hyperchaotic nonlinear dynamical system with two positive Lyapunov exponents is presented. Exhaustive dynamic analyses of the novel hyperchaotic model using several dynamical studies are described. The dynamics of the system considered are first investigated analytically and numerically to explore phenomena and the selection of hyperchaotic behavior utilized for designing image cryptosystem. Since the proposed hyperchaotic model has rich dynamics, it displays hidden attractors. It emerges from this dynamic the existence of a single unstable equilibrium point giving rise to self-excited attractors, hysteresis phenomenon, and hyperchaotic behavior strongly recommended for securing information by its character. Furthermore, the feasibility and synchronization of the proposed system are also presented by developing, respectively, Raspberry surveys and an adaptive synchronization approach of two identical hyperchaotic systems. By employing the hyperchaotic behavior of the 4D map, an image encryption scheme is proposed as well. It is one round of a pixel-based permutation and a bit-wise diffusion phase. The secret key of the 4D map is derived from the SHA-256 value of the input image. It acts as the signature of the input image. Hence, the secret key exhibits high sensitivity to single-bit alteration in the image, which makes the cryptosystem robust against chosen/known-plaintext attacks. Performance analyses prove that the proposed cryptosystem provides the best in terms of the performance/complexity trade-off, as compared to some recently published algorithms.

A novel image encryption algorithm based on self-confusion was proposed in this paper. The image encryption process is composed of covering operation, self-confusion and diffusion. The chaotic system was employed to generate one pseudo-random matrix and two pseudo-random sequences for image encryption. The matrix is used to cover the image, and the sequences are used to diffuse the image. The image is shuffled in the self-confusion by its own data, making the proposed image encryption algorithm be plaintext-related. The simulation results show that the proposed scheme has the merits of fast speed and good security, and can be a candidate for image information security.

In recent years, encryption technology has been developed quickly and many image encryption methods have been put forward. Chaos based image encryption technique is a new encryption technique for images. It utilizes chaos random sequence to encrypt image, which is an efficient way to deal with the intractable problem of fast and highly secure image encryption. However, the Chaos based image encryption technique has some deficiencies, such as the limited accuracy problem. This paper researches on the chaotic encryption, DES encryption and a combination of image encryption algorithm, and simulate these algorithms, through analysis of the algorithm to find the gaps. And on this basis, the algorithm has been improved. The new encryption scheme realizes the digital image encryption through the chaos and improving DES. Firstly, new encryption scheme uses the Logistic chaos sequencer to make the pseudo-random sequence, carries on the RGB with this sequence to the image chaotically, then makes double time encryptions with improvement DES, displays they respective merit. Theoretical analysis and the simulation indicate that this plan has the high starting value sensitivity, and enjoys high security and the encryption speed. In addition it also keeps the neighboring RGB relevance close to zero. The algorithm can be used in the actual image encryption.

Image Encryption Algorithm based on Pseudo-random Sequence

An image encryption scheme based on an improved Hilbert curve and a novel 4D hyper-chaotic system

These days, a countless number of digital images are made in many fields, such as military, medicine, education, and personal affairs. As digital images usually contain secret or private data, image encryption has grown into a hot issue in theoretical study and in its practical presentation. In this paper an image encryption algorithm based on Logistic map will be used. Contrasting most of the existing image encryption algorithms, the proposed algorithm gives the original image as an integer pixel, and uses Logistic map for confusion and Galois field LFSR for diffusion. The consumption of logistic map and Galois field LFSR makes the proposed algorithm achieves not only a desirable level of security, but also high effectiveness, so the algorithm is suitable for practical application. Apart from this, the algorithm accepts a confusion-diffusion-confusion structure to yield good confusion and diffusion things which are the goods of the operation of a secure cipher. Simulation results and security analysis advice that the proposed algorithm has many desirable things of a perfect cryptosystem, thus it is very suitable for practical applications. The security analyses performed are Histogram analysis, Correlation analysis, Entropy analysis, Encryption Quality analysis, Differential analysis, Error metric analysis.

This study introduces a cutting-edge image encryption algorithm aimed at elevating security standards. The Pan-Tompkins Algorithm (PTA) for key generation is proposed for the first time in this study. Additionally, employing steganography through the Least Significant Bit (LSB) method for embedding keys within the encrypted image enhances secure key distribution, thereby fortifying the encryption process. On the other hand, the integration of advanced algorithms, such as Zigzag scanning, the Affine Image Encryption Algorithm (AA), and the Vigenere Image Encryption Algorithm (VA), constitutes the fundamental innovation of the proposed image encryption algorithm. The proposed algorithm is named PanAAVA:Affine Algorithm and Vigenere Algorithm Encryption with PTA-Based Key Generation. The PanAAVA algorithm ensures unparalleled security by encrypting the positions and values of pixels using AA and VA. Notably, using PTA for key generation marks a distinctive and new key generation method feature of the algorithm. To assess the effectiveness of the PanAAVA, a comprehensive comparative analysis is conducted against well-established encryption methodologies, including Lena, Baboon, Airplane, and Pepper.The PanAAVA demonstrates exceptional proficiency in histogram analysis. The PanAAVA demonstrates a Unified Average Changing Intensity (UACI) of 33.4044%. Additionally, the Number of Pixels Change Rate (NPCR) is measured at 99.7442%, showcasing the algorithm’s effectiveness in inducing significant pixel changes. The proposed algorithm’s Mean Square Error (MSE) is calculated at 3.20679E5%. The proposed algorithm’s Peak Signal to Noise Ratio (PSNR) is recorded at 9.512475. The Key Space Size of the proposed algorithm is measured at 2209. Regarding correlation analysis, the PanAAVA achieves a high correlation score of 7.9996. The proposed algorithm successfully passes the National Institute of Standards and Technology (NIST) analysis, demonstrating a remarkably strong correlation close to 0 and a Structural Similarity Index Measure (SSIM) of 0.9977. Furthermore, regarding quantum communication, the proposed algorithm maintains stable key rates of 47.5 ± 0.8 kHz during the day and 50.9 ± 0.7 kHz at night. Additionally, PanAAVA achieves low Quantum Bit Error Rate (QBER) values of 4.77 ± 0.02, ensuring reliable and secure communication. The PanAAVA also demonstrates robust asymmetries at 49.81 ± 0.02 and 50.14 ± 0.03 for a crystal length of 20 mm. highlighting PanAAVA’s adaptability and effectiveness in different scenarios. PanAAVA outperforms other encryption algorithms concerning performance measurements and comparisons. In conclusion, the PanAAVA emerges as a beacon of superior security capabilities and innovation in image encryption, showcasing the potential to redefine standards in the field.

Chaotic systems are widely used in various fields, but under the finite precision device, chaotic systems would fall into a cycle and subsequently the performance degrade. Thus, the suppression method of the dynamic degradation of digital chaos is receiving increasing attention. This paper proposes a new improvement model to suppress the dynamical degradation under finite computing accuracy equipment. By using the difference between two maps of the same type but with different initial values, and the state feedback function to improve the performance of the digital chaotic map and extend the time before the chaotic map enters the cycle. Take the 1D Logistic map and x-dimensional of Baker map as examples to prove the effectiveness of the improvement model. Then we proposed a new key selection method, in what part of information of the image would be selected by using a chaotic map to generate a special value. The special value would be used as part of the key. Based this method, a new image encryption algorithm was proposed. The information entropy of the image encrypted by our encryption algorithm is 7.9972, the NPCR and UACI are 0.996095 and 0.334635, respectively, what both are very close to ideal values. The experimental simulation results show that the image encryption scheme exhibits good performances and high security and effectively resists various attacks.