Next Article in Journal
An Improved Version of the Parameterized Hardy–Hilbert Inequality Involving Two Partial Sums
Next Article in Special Issue
A Fast Image Encryption Scheme Based on a Four-Dimensional Variable-Parameter Hyperchaotic Map and Cyclic Shift Strategy
Previous Article in Journal
Nonequilibrium Molecular Velocity Distribution Functions Predicted by Macroscopic Gas Dynamic Models
Previous Article in Special Issue
A Hierarchical Authorization Reversible Data Hiding in Encrypted Image Based on Secret Sharing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A DNA Encoding Image Encryption Algorithm Based on Chaos

1
School of Cyber Science and Engineering, Southeast University, Nanjing 211189, China
2
Key Laboratory of Specialty Fiber Optics and Optical Access Networks, Shanghai University, Shanghai 200444, China
3
Hunan Zhentong Zhiyong Artificial Intelligence Technology Co., Ltd., Changsha 410026, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(8), 1330; https://doi.org/10.3390/math13081330
Submission received: 12 March 2025 / Revised: 10 April 2025 / Accepted: 15 April 2025 / Published: 18 April 2025
(This article belongs to the Special Issue Information Security and Image Processing)

Abstract

:
With the development of society and the Internet, images have become an important medium for information exchange. To improve the security of image encryption and transmission, a new image encryption algorithm based on bit-plane decomposition, DNA encoding and the 5D Hamiltonian conservative chaotic system is proposed. This encryption scheme is different from the traditional scrambling and diffusion methods at the level of image spatial pixels but encodes images into DNA strands and completely scrambles and diffuses operations on the DNA strands to ensure the security of images and improve the efficiency of image encryption. Firstly, the initial value sequence and convolution kernel of the five-dimensional Hamiltonian conservative chaotic system are obtained using SHA-256. Secondly, the bit-plane decomposition is used to decompose the image into high-bit and low-bit-planes, combine with DNA encoding to generate DNA strands, hide the large amount of valid information contained in the high-bit-planes, and preliminarily complete the hiding of the image information. In order to further ensure the effect of image encryption, seven DNA operation index tables controlling the diffusion process of the DNA strands are constructed based on the DNA operation rules. Finally, the scrambled and diffused DNA strand is decomposed into multiple bit-planes to reconstruct an encrypted image. The experimental results and security analysis show that this algorithm has a large enough key space, strong key sensitivity, high image encryption quality, strong robustness and high encryption efficiency. In addition, it can resist statistical attacks, differential attacks, and common attacks such as cropping attack, noise attack and classical attack.

1. Introduction

With the popularization of the Internet and various information technologies, digital images carry more effective information and have stronger readability than text. At the same time, digital images play an important role as information carriers in military, medical, and other sensitive fields of national security. Therefore, if the image is stolen or even tampered with by criminals in the transmission process, it is easy to cause the leakage of all kinds of information, which poses a threat to the life and property of citizens and even national security. To prevent images from being stolen or tampered with without authorization, image encryption is an effective method to protect image content security.
The chaotic system has a wide range of applications in image encryption and other cryptographic systems due to the complex dynamic behavior, which greatly improves the key security in the cryptographic system. As early as 1963, Lorenz discovered the first chaotic attractor through the study of meteorology, which was later known as the Lorenz system [1]. In 1989, Tufillaro further extended the study of the chaotic behavior of chaotic systems by studying the nonlinear vibration phenomenon of elastic strings [2]. The chaotic system is periodic and deterministic, so it has a strong fit with the encryption strategy of a cryptosystem. In the same year, Matthews first proposed the application of chaotic systems to image encryption and using a chaotic system to generate a set of random numbers to ensure the security of keys in the cryptosystem [3]. In 1998, Fridrich first proposed to apply the 2D chaotic system to image encryption, which greatly improves the security of image encryption. Since then, image encryption has gone through a series of developments and derived a series of new image encryption algorithms, such as DNA encoding [4], genetic recombination [5], DWT transforms [6], wavelet transforms [7], compression sensing [8,9,10], etc. These algorithms are essentially upgrades and improvements of cryptosystems combined with a chaotic system. It has become the main trend of image encryption algorithm research to develop a new image encryption algorithm based on a chaotic system and other technologies. In recent years, many novel and efficient image encryption algorithms have been proposed. The algorithm [11] extended the quantum coding to the image scrambling and diffusion operations, and it used the exchange operation to change the gray value of the image based on the quantum image model. In the same year, the author of [12] combined the Sine map and the Tent map to design a new two-dimensional chaotic system, so as to enhance its chaotic behavior. In 2021, Hua et al. optimized the whole process of sparsifiction, the sampling and embedding of compressed sensing to solve the problems of poor quality of reconstructed images and low efficiency of image encryption. The adaptive thresholding sparsification, the random-order Bernoulli random matrix and the matrix coding technology were introduced to improve the image encryption effect and decryption quality [13]. The S-box is also a relatively new research direction. Hua et al. used the enhanced logistic map as the main core to generate the Latin square matrix to construct the S-box [14]. In the next year, Zou et al. designed a scrambling and diffusion method based on DNA strand, which achieves the purpose of DNA strand scrambling by replacing different DNA strand fragments [15]. Recently, the authors of [16] proposed a new chaotic image compression encryption scheme. In the paper, they combine the filters and feed-forward structure to create a new uniform chaotic system, which has great performance on the generation of key stream. In general, with the in-depth study of chaotic phenomena, the introduction of various other new technologies can be well integrated with chaotic systems. However, the traditional chaotic systems are not invulnerable; they also have a series of security risks, such as being vulnerable to refactoring attacks, as well as having a periodic window and poor sequential randomness [17]. Chaotic systems can be divided into dissipative chaotic systems and conservative chaotic systems according to whether energy is conserved or not. Compared with the dissipative system, the conservative system does not produce attractors, so it has better ergodic property and can resist reconstruction attacks [18]. Compared with the dissipative system, the conservative chaotic system is a more ideal random sequence generator. The authors of [19] draw on this 5D conservative chaotic system combined with the neural network, showing better image encryption quality.
DNA encoding is used to convert digital images into DNA strands by simulating the composition rules of bases in DNA strands. Due to the compatibility between DNA strand and cryptography, a large number of researchers have invested in the research of the image encryption algorithm based on DNA coding. Sakshi et al. designed a symmetric key image encryption algorithm based on the 3D chaotic system and DNA coding; the chaotic system is used to generate the symmetric image, and the DNA coding rules are used to scramble and diffuse the image, which creates a certain degree of security [20]. Wang et al. proposed to diffuse image pixels using five DNA operations (DNA addition, DNA subtraction, DNA XOR and DNA XNOR), and the Fisher–Yates scrambling scheme is introduced into the process of image scrambling to further enhance the encryption effect of the image [21]. Bhat et al. designed a color image encryption framework based on DNA encoding, the hyper-chaotic system and elliptic curve cryptography; the framework uses a hyper-chaotic system to dynamically control the coding rules of the image in each color channel, which enhances the randomness of the DNA sequence coding [22]. Wang et al. first used the improved zigzag transformation to scramble the image in the spatial domain and then encoded the image into DNA strands through DNA coding for further diffusion operation [23]. Zou et al. first encoded the image into a DNA strand and then performed the scrambling and diffusion operation completely on the DNA strand [15]. Its DNA strand operation mode is to construct long and short DNA strands for DNA strand exchange and diffusion processes, respectively. In general, most of the existing DNA coding encryption schemes have the problem of poor encryption efficiency, which needs to be further improved.
Aiming at further improving the efficiency of image encryption and ensuring the quality of encryption, we propose a DNA encoding image encryption scheme based on the 5D Hamiltonian conservative chaotic system. Firstly, SHA-256 is used to generate the initial value of the chaotic system and control the scrambling process of the DNA strand. Secondly, a new DNA strand generation method is proposed. Combined with DNA coding, the DNA strand is generated by combining the high-bit-plane and the low-bit-plane, and the effective information in the high-bit-plane is efficiently hidden, and the image information is initially hidden. In addition, the convolution sequence related to the plaintext is used to scramble the DNA strand to further scramble the original positions of the DNA strand bases. Finally, based on the operation rules of DNA operation, seven DNA index tables were constructed, and the diffusion process of the DNA strand was further controlled by retrieving the DNA index tables.
The main contributions of this paper are as follows:
  • A new method of DNA strand generation is explored, which takes DNA encoding as a bridge and combines the high-bit-planes with the low-bit-planes to hide the effective information in the high-bit-planes.
  • In order to further improve the encryption quality and ensure encryption efficiency, seven DNA operation index tables are constructed based on the operation rules of DNA computing. The diffusion operation of the DNA strand is carried out by searching the index table, which simplifies and accelerates the diffusion process of the DNA strand.
The remaining paper is structured as follows: Section 2 introduces some relevance theory; Section 3 explains the encryption and decryption process in detail; Section 4 shows the experimental results; Section 5 carries out the security analysis; Section 6 makes the conclusion and outlook.

2. Relevance Theory

2.1. 5D Harmiltonian Conservative Hyper-Chaotic System

High-dimensional chaotic systems exhibit fundamentally distinct characteristics compared to their low-dimensional counterparts, particularly through their expanded state space and intricate dynamical behaviors that significantly elevate state prediction complexity. The 5D Hamiltonian chaotic system belongs to the class of high-dimensional conservative hyper-chaotic systems, which exhibit high complexity and unpredictability. This system can evolve in a larger state space through nonlinear dynamics, avoiding the periodicity or regularity that may arise in low-dimensional systems when initial conditions or parameters change. Therefore, this system provides stronger randomness for encryption applications and can effectively resist various types of attacks. Furthermore, the 5D Hamiltonian chaotic system preserves the energy conservation property under Hamiltonian dynamics conditions, which enables the system to maintain strong stability and sensitivity over long periods of evolution. By introducing higher dimensions, the system’s degrees of freedom increase, making its dynamic behavior more complex, thereby enhancing the chaotic effects during the encryption process and further improving the security of image encryption [18].
The mathematical formulation of the 5D Hamiltonian conservative hyper-chaotic system is presented below:
x ˙ = x y + a z y ˙ = x 2 + z 2 + c w z ˙ = y z + z w a x + b v w ˙ = z 2 + v 2 c y v ˙ = w v b z
where a , b , c = 10 , 13 , 10 denote system parameters. This hyper-chaotic system manifests five Lyapunov exponents ( L E 1 = 1.18 ,   L E 2 = 0.02 ,   L E 3 = 0 ,   L E 4 = 0.02 ,   L E 5 = 1.18 ), specifically comprising two positive exponents with the total sum of all five exponents equaling zero. This property mathematically verifies the system’s Hamiltonian conservative nature, where energy preservation occurs despite its hyper-chaotic dynamics. The coexistence of pseudo-randomness and exceptional complexity, as demonstrated by the two positive Lyapunov exponents and five-dimensional phase space, establishes this system as a paradigm of conservative hyper-chaos. Visual evidence of its chaotic attractor structure is provided in Figure 1, showcasing the system’s non-repeating yet energy-bound trajectory patterns.

2.2. Bit-Plane

An integer from 0 to 256 can be converted to an 8-bit binary number. For a grayscale image, the value of each pixel of the image is an integer in the range of 0 to 255. So, each gray value can be converted into an 8-bit binary number. 8 bits of the whole pixels can reconstruct 8 bits planes. As shown in Figure 2, From the 1st bit-plane to the 8th bit-plane, the clarity of the image is gradually improved, and the effective information in the image is gradually identifiable. The proportion of information carried by each bit-plane can be quantitatively calculated using the following formular.
p ( k ) = 2 k 1 m = 1 8 2 m 1
As is listed in Table 1, the information-carrying ratio increases as the bit-plane rises. The information-carrying ratio of high-bit-planes (top 4) is almost 94%; on the contrary, the four low-bit-planes only account for nearly 5.8%. As a consequence, the four high-bit-planes contain most of the effective information in the image, and hiding the effective information in the high-bit-planes to the low-bit-planes can effectively ensure the security of the image. In this paper, a method based on DNA encoding is proposed to hide the effective information from the high-bit-planes to the low-bit-planes.

2.3. DNA Encoding and Decoding Rules

In the field of biology, deoxyribonucleic acid (DNA) is an important material for storing genetic information in biological cells. DNA consists of nucleotides with four different bases. The four bases are adenine (A), guanine (G), cytosine (C) and thymine (T). Based on the composition principle of four bases in DNA strand, two binary numbers are used to represent each base in cryptography. The four bases can form 24 combinatorial possibilities. However, according to Watson Crick’s complement rule, A is paired with T and C is paired with G, only eight legal combinations exist, as shown in Table 2. In addition, There are many types of DNA arithmetic operations like XOR, XNOR, addition and subtraction, right shift and left shift. The results of arithmetic operations are shown in Table 3, Table 4, Table 5 and Table 6.
The security of DNA operation rules, such as XOR, XNOR, addition, subtraction, and shift operations, plays a crucial role in the effectiveness of the encryption algorithm. XOR operations are widely used due to their ability to produce significant randomness and diffusion, which are key for making the encrypted data unpredictable. However, XOR is susceptible to known-plaintext attacks, where attackers with partial information could reverse the operation and deduce the key. Similarly, the XNOR operation, being the complement of XOR, offers symmetry but also introduces potential vulnerabilities. Its predictable nature can be exploited if the key space is not sufficiently large, making it more prone to certain attacks.
Addition and shift operations (right and left shifts) contribute to the encryption by altering the position of the DNA sequence elements. These operations increase confusion and diffusion, preventing simple repetitive patterns. However, without sufficient key variation, they may produce predictable sequences that could be vulnerable to statistical attacks. Therefore, while these operations enhance encryption, their security depends heavily on the proper management of key space and the frequency of application.
In summary, while each DNA operation rule provides specific advantages in terms of increasing randomness, confusion, and diffusion, their security must be carefully balanced. The combination of multiple DNA operations with a large, unpredictable key space ensures robust resistance to cryptographic attacks, thus strengthening the overall encryption system.

3. Encryption and Decryption Process

3.1. Key Feature Extractor

Step 1: Suppose we have a sequence of decimal numbers, defined as key.
Step 2: Perform the bit XOR operation on the first and second values in the sequence Key; the result is denoted as Keyfeature.
Step 3: Perform the bit XOR operation on the value of Keyfeature and the next value of Key; the result is assigned to Keyfeature. By parity of reasoning, the value of Keyfeature is continuously subjected to bitwise XOR operation with the next value in the sequence Key until the last value in Key, the bitwise XOR operation is finished, and the final Keyfeature is obtained.
The algorithm of the key feature extractor is exhibited in Algorithm 1.
Algorithm 1: The Key Feature Extractor
Input :   The   sequence   of   decimal   numbers   K e y Output :   The   value   of   K e y f e a t u r e K e y f e a t u r e = b i t x o r K e y 1 ,   K e y 2 ; n = s i z e K e y , 2 ; f o r   i = 3 : n K e y f e a t u r e = b i t x o r K e y f e a t u r e , K e y i ; e n d r e t u r n   K e y f e a t u r e

3.2. Plaintext-Related Sequence Generation

Step 1: Use SHA-256 to calculate the hash string of plain image in three-direction.
Step 2: Convert the previous hash string to 32 bits decimal sequence s and sort them in ascending order.
Step 3: Perform feature extraction on the sorted decimal sequence s by key feature extractor to obtain k e y f e a t u r e 1 . Then, divide s into four sub-sequences. The four sub-sequence lengths are 5, 9, 9, and 9, respectively. Each sub-sequence in turn takes the sequence of corresponding length in the sequence s .
Step 4: The first sub-sequence is described as K e y . Then, reshape the second, third and fourth sub-sequences to three 3 × 3 sequences (S_conv1, S_conv2, S_conv3). S_conv4 is obtained by mod operation on S_conv3:
S _ con v 4 = mod ( S _ con v 3 , k e y f e a t u r e 1 )
From Step 1 to Step 4 can be summarized as the process of generating the plaintext-related sequences, as shown in Figure 3.
Step 5: The four convolutional sequences S _ c o n v 1 , S _ c o n v 2 , S _ c o n v 3 and S _ c o n v 4 are combined and then the combined sequence is reshaped as a row vector S _ c o n v of size M × N × 4 :
S _ c o n v = [ S _ c o n v 1 ; S _ c o n v 2 ; S _ c o n v 3 ; S _ c o n v 4 ] S _ c o n v = r e s h a p e ( S _ c o n v , 1 , 4 × M × N )
The obtained row vector S _ c o n v is used as the permutation sequence of the encryption and decryption process.

3.3. Key Stream Generator

Step 1: The 5D Harmiltonian conservative hyper-chaotic system needs five initial values to generate five pseudo-random sequences. The calculation formular is given below:
x 0 = α sin ϕ + cos i = 1 n [ p ( i ) / π × 10 6 ] y 0 = β sin ψ + cos i = 1 n [ S _ c o n v 1 ( i ) / π × 10 9 ] z 0 = γ sin φ + cos i = 1 n [ S _ c o n v 2 ( i ) / π × 10 10 ] w 0 = σ sin χ + cos i = 1 n [ S _ c o n v 3 ( i ) / π × 10 10 ] v 0 = δ sin θ + cos i = 1 n [ S _ c o n v 4 ( i ) / π × 10 10 ]
where n denotes the size of plain image. α , β , γ , σ , δ , ϕ , ψ , φ , χ , θ denote the control parameter of the initial sequence. These ten parameters are not randomly chosen but depend on the plaintext image and multiple features extracted by the key feature extractor. The ten parameters are set as follows:
α = k e y ( 1 ) , β = k e y ( 2 ) , γ = k e y ( 3 ) , σ = k e y ( 4 ) , δ = k e y ( 5 ) ϕ = k e y f e a t u r e 1 , ψ = k e y f e a t u r e 2 , φ = k e y f e a t u r e 3 , χ = k e y f e a t u r e 4 , θ = k e y f e a t u r e 5
Step 2: Substituting Equation (6) into Equation (5) results in five initial values x 0 , y 0 , z 0 , w 0 , v 0 of the hyper-chaotic system. According to Equation (1), substituting x 0 , y 0 , z 0 , w 0 , v 0 into Equation (1) obtains a pseudo-random matrix P R with M × N rows and 5 columns.
Step 3: Perform three different transformation operations on P R , as shown below:
P R 1 = mod ( P R × 2 16 , 256 ) P R 2 = mod ( ( P R + 100 ) × 10 10 , M × N ) + 1 P R 3 = mod ( ( P R + 100 ) × 10 14 , 256 ) + 1
Step 4: Use P R 1 , P R 2 , P R 3 to further generate the key stream needed in DNA strand encoding. DNA strand confusion and diffusion are shown below:
K M = r e s h a p e ( P R 1 ( : , 1 ) , M , N ) K E = r e s h a p e ( P R 1 ( : , 2 : e n d ) , 1 , M × N × 4 ) K P = r e s h a p e ( P R 3 ( : , 2 : e n d ) , 1 , M × N × 4 ) K X = s e t d i f f ( 1 : M × N , u n i q u e ( P R 2 ( : , 2 : e n d ) ) )
The flowchart of the whole DNA strand generation is shown in Figure 4. The specific steps are as follows:
Where u n i q u e means removing duplicate elements from the sequence, s e t d i f f A , B denotes the elements not present, and A is inserted into the end of the sequence B. K M is used as a mask image of the process of image encryption. K E is the indicator sequence of DNA strand encoding. K P is the indicator sequence of DNA strand diffusion. K X is the indicator sequence of DNA strand generation.

3.4. DNA Strand Generation

The flowchart of the whole DNA strand generation is shown in Figure 4. The specific steps are as follows:
Step 1: Perform bit-plane decomposition on the plain image to obtain eight bit-planes (plane i , i 1 , 8 ). The high-bit-plane contains more effective information of the image than the low-bit-plane. Therefore, the high-bit-plane can be fused with the low-bit-plane to generate a DNA strand, and the effective information in the image can be hidden in the DNA strand as much as possible.
Step 2: Divide the eight bit-planes into four groups; plane and plane 9 i are divided into one group, i 1 , 8 .
Step 3: Transform two bit-planes of each group to two row-vectors of length M N , then use key stream K X to control the fusion process of the transformed high-bit-plane and low-bit-plane. Each group of bit-planes can generate one DNA strand. Therefore, four DNA strands A , B , C , D are generated. The DNA strand generation process is shown in Figure 5.
As shown in Figure 5, K X i , : is the index sequence of Plane 9 i ; Plane i and Plane 9 i are the corresponding row-vectors of low-bit-planes and high-bit-planes; binary sequence denotes the sequence after the fusion of Plane K X and Plane i ; the DNA strand denotes the final generation DNA sequence. The following is illustrated with the first element in the sequence K X :
The 1st value of K X is 3. Find that the 3rd element of the Plane 9 i is 0, merge with the 1st element of the sequence in Plane i , obtain the 1st binary value 10 in the binary sequence, then according to the first encoding rule of DNA encoding in Table 2, obtain the 1st element in the DNA strand. Similarly, by traversing all the elements in the keystream K X , the two-bit-planes can be combined to generate the corresponding DNA strand.

3.5. DNA Strand Diffusion

To completely ensure the randomness of each base in the DNA strand, we adopt eight DNA encoding rules instead of a single one to encode the DNA strands, which greatly improves the security of the DNA strand encoding results.
Step 1: Splice the four DNA strands ( A , B , C , D ) into a single DNA strand with a length of 4 × MN.
Step 2: Since each value in the key stream K E is an integer between 0 and 255, K E cannot be directly used to control the selection of encoding rules. It is necessary to transform the value range of the keystream K E to be between 1 and 8. The transformation formula is given below:
[ ~ , q ] = s o r t ( S _ c o n v ) p s = e d s ( q )
Step 3: R is used to control the process of DNA strand encoding. Each element in the sequence R indicates the encoding rule used by the base at the corresponding position in the DNA strand. As is shown in Figure 6, the first element of the sequence R is 7, so the first base of DNA strand ( C ) uses Rule 7 to encode the base C , and the base C has transformed the base T under the influence of Rule 7. Similarly, the other bases in the DNA strand are encoded in the same way to obtain final encoded DNA strand e d s .
Step 4: As shown in Equation (4), use S _ c o n v permutation sequence to permute the DNA strand.
[ ~ , q ] = s o r t ( S _ c o n v ) p s = e d s ( q )
where q denotes the index of permutation, e d s represents the encoded DNA strand, and p s denotes the permutated DNA strand.

3.6. DNA Strand Diffusion

In this stage, seven operations are used to perform DNA strand diffusion (XOR, Addition, Multiple, XNOR, Subtract, Right-Shift, Left-Shift).
Step 1: Since each value in the key stream K P is an integer between 0 and 255, K P cannot be directly used to control the selection of operation rules. It is necessary to transform the value range of the keystream K P to be between 1 and 7. The transformation formula is given below:
o p = f l o o r ( mod ( K P , 7 ) ) + 1
Step 2: Construct the operation table, as is shown in Equation (12):
X O R = 0 1 2 3 1 0 3 2 2 3 0 1 3 2 1 0 , A D D = 1 0 3 2 0 1 2 3 3 2 1 0 2 3 0 1 , M U L = 3 2 1 0 2 3 0 1 1 0 3 2 0 1 2 3 , X N O R = 3 2 1 0 2 3 0 1 1 0 3 2 0 1 2 3 , S U B = 1 2 3 0 0 1 2 3 3 0 1 2 2 3 0 1 , R S h i f t = 0 1 2 3 1 2 3 0 2 3 0 1 3 0 1 2 , L S h i f t = 0 3 2 1 1 0 3 2 2 1 0 3 3 2 1 0 .
Step 3: The seven operations all need two DNA strands. Only one DNA strand cannot meet the need of the process of DNA strand diffusion. K M is used as a mask image of the process of image encryption. Therefore, the K M is used to generate another DNA strand. Similarly, the bit-plane decomposition is performed first, and the corresponding DNA strand is generated. Through the above process, the mask image K M is transformed into another DNA strand p t .
Step 4: The key stream o p is used to control the process of DNA strand encoding. Each element in the sequence o p indicates the operation rule used by the base at the corresponding position between the encoded DNA strand p s and the mask DNA strand p t .
Step 5: Since the operation tables are defined in Equation (12), the diffused DNA strand p d can be obtained only by looking up the corresponding table according to the control sequence o p . The table lookup method can be defined as follows:
f o p e r a t e ( b a s e 1 , b a s e 2 ) = o p e r a t e ( b a s e 1 + 1 , b a s e 2 + 1 )
where f o p e r a t e . represents f X O R . , f A D D . , f M U L . , f X N O R . , f S U B . , f R S h i f t . , and f L S h i f t . ; o p e r a t i o n . denotes the corresponding operation table, as shown in Equation (7). This denotes the base of the sequence p s , and the b a s e 2 denotes the base of the sequence p t . The values of the four bases A , G , C , T are 0, 1, 2, 3. For example, base1 = A, base2 = T, f X O R ( A , T ) = X O R ( A + 1 , T + 1 ) = X O R ( 1 , 4 ) = 3 = T .
As is shown in Figure 7, the first element of the sequence o p is 3, so the third operation table MUL table is used; the first elements of p s and p t are base C and base T . According to the Equation (13), the first element of diffused DNA strand p d can be obtained:
f M U L C , T = M U L ( C + 1 , T + 1 ) = M U L ( 3 , 4 ) = 2 = C
Consequently, the first element of diffused DNA strand p d is base C . The algorithm of DNA strand diffusion is shown in Algorithm 2.
Step 6: Use the DNA encoding rules, which are shown in Table 2, to decode the diffused DNA strand p d to get eight bit-planes, then combine the eight bit-planes to generate the final encrypted image.
Algorithm 2: The Process of DNA Strand Diffusion
Input :   Masked   DNA   strand   p t ,   Encoded   DNA   strand   p s , the   control   sequence   o p Output :   The   diffused   DNA   strand   p d / /   the   length   of   both   DNA   strands   and   control   sequence   is   4 m n X O R = 0   1   2   3 ;   1   0   3   2 ;   2   3   0   1 ;   3   2   1   0 ; A D D = 1   0   3   2 ;   0   1   2   3 ;   3   2   1   0 ;   2   3   0   1 ; M U L = 3   2   1   0 ;   2   3   0   1 ;   1   0   3   2 ;   0   1   2   3 ; X N O R = 3   2   1   0 ;   2   3   0   1 ;   1   0   3   2 ;   0   1   2   3 ; S U B = 1   2   3   0 ;   0   1   2   3 ;   3   0   1   2 ;   2   3   0   1 ; R S h i f t = 0   1   2   3 ;   1   2   3   0 ; 2   3   0   1 ;   3   0   1   2 ; L S h i f t = 0   3   2   1 ;   1   0   3   2 ; 2   1   0   3 ;   3   2   1   0 ; f o r   i = 1 : 4 m n                     s w i t c h   o p i                                       c a s e   1                                                 p d i = A D D p s i + 1 , p t i + 1 ;                                       c a s e   2                                                 p d i = S U B p s i + 1 , p t i + 1 ;                                       c a s e   3                                                 p d i = X O R p s i + 1 , p t i + 1 ;                                       c a s e   4                                                 p d i = X N O R p s i + 1 , p t i + 1 ;                                       c a s e   5                                                 p d i = M U L p s i + 1 , p t i + 1 ;                                       c a s e   6                                               p d i = R S h i f t p s i + 1 , p t i + 1 ;                                       c a s e   7                                               p d i = L S h i f t p s i + 1 , p t i + 1 ;                         e n d e n d r e t u r n   p d
The flowchart of the image encryption process is shown in Figure 8.

3.7. Decryption Process

In general, the decryption process is the reverse process of the image encryption process. The flowchart is shown in Figure 9. The specifics are described below:
Step 1: Substitute Key and keyfeature into Equations (5) and (6) to obtain the initial value of the chaotic system. Then, use the 5D Harmiltonian conservation hyper-chaotic system to generate four key streams K E , K P , K M , K X .
Step 2: Perform bit-plane decomposition operation on cipher image and mask image K M .
Step 3: Transform every bit-planes of cipher image to row vectors of length MN, the two vectors can generate one DNA strand, so the eight row vectors can generate four DNA strands, then splice four DNA strands with the length of M*N to obtain the required length of the 4*M*N DNA strand.
Step 4: Perform bit-plane decomposition operation on mask image, then perform DNA strand generation to obtain another DNA strand PT with the length of 4*M*N.
Step 5: Use key stream KE to control DNA strand encoding, then we can obtain the encoded DNA strand.
Step 6: Remove the diffusion state of the encoded DNA strand by another DNA strand PT and the diffusion control sequence KP.
Step 7: Remove the permutation state of the encoded DNA strand by sequence S_conv.
Step 8: Use KE to perform DNA strand decoding, then use KX to recover the bit-plane. Finally, merge the bit-planes to obtain the final encrypted image.

4. Experiment Results

To demonstrate the effectiveness of our algorithm, the experiments are divided into two groups, grayscale image encryption experiment and color image encryption experiment. As is shown in Figure 10, Group 1 contains four grayscale images (Clock, Bridge, Boat, Male). As is shown in Figure 11, Group 2 contains four color images (Female, Pine, House, Fighter). The experiment result shows that our encryption algorithm is effective for grayscale image and color image, the cipher image of both cannot be identified at the same time.

5. Security Analyses

5.1. Key Space Analysis

As is shown in Equation (5), the Keys are as follows: x 0 , y 0 , z 0 , w 0 , v 0 , α , β , γ , σ , δ , ϕ , ψ , φ , χ , θ . The precision of computers is usually 64 bits. Therefore, the key space is 10 16 15 = 10 240 2 797 > 2 100 . This proves that the key space of our method is large enough to defend against exhaustive attacks. Table 4 shows the result of key space comparison. The comparison results prove that the key space of our algorithm has better performance than other similar image encryption methods using DNA encoding.

5.2. Key Sensitivity Analysis

An effective encryption algorithm should ensure that even if the attacker fine-tunes any value in the key, it can still ensure that the modified key cannot be decrypted to get the original image. As is shown in Figure 12, The decrypted image cannot be recognized with a very small fine-tuning of any value in the key (even 10 16 ), and the original image can only be decrypted with the original correct key.
We also investigate the effect of fine-tuning the key on the cipher image. The differences between the original cipher image and fine-turned key cipher images are shown in Figure 13. The quantified difference rates are shown in Table 7 and Table 8, and the difference rate is up to 99.67%. The experiment results show that making even small changes to the secret key can have a dramatic impact on the cipher image; there is almost no similarity between the original ciphertext image and the fine-tuned key ciphertext image.

5.3. Statistic Analyses

5.3.1. Histogram Analysis

Figure 14 shows the 3D histograms of different grayscale images and color images. It can be clearly observed from the figure that the histograms of plain images are not uniform; on the contrary, the histogram of the encrypted image is uniform. At the same time, the variance of the histogram is also used to quantitatively analyze the degree of uniformity of the histogram. A larger variance indicates a poorer uniformity of the image, and more information is contained in the image. The calculation formula is as follows:
var w = 1 l 2 i j 1 2 w i w j 2
where w i and w j represent the cumulative number of pixels in the image whose pixel values are equal to i and j. l = 256 denotes the 256 grayscale levels in the histogram. Table 9 lists the variances of histograms of the four grayscale images shown in Figure 14a,e,i,m. It is observed that the variance of the histogram of the encrypted image is far less than that of the original image. Table 10 shows strands for the histogram variance of different grayscale images under different keys. The first column variance of Table 10 corresponds to the unchanged key, and the variance of the other columns is obtained by changing the α , β , γ , σ , δ , ϕ , ψ , φ , χ , θ in the key. Table 11 notes the change rate of each changed key compared with the original key. It can be seen from Table 11 that only when the change rate of variance reaches 10.67% is it at its highest. In addition, all the average change rates are below 4.5%. The variance change rate of different keys demonstrates that the performance of the histogram is entirely dependent on the plain image. Table 12 indicates the comparison result of histogram variances, and the proposed algorithm has the lowest variance compared to the other similar algorithms. The experiment result indicates that the proposed algorithm can resist any kind of statistical attack.

5.3.2. Correlation Analysis of Adjacent Pixels

The adjacent pixel correlation is usually used to describe the correlation degree of pixel values in adjacent image positions, which contain horizontal (H), vertical (V), and diagonal (D) three directions. An excellent image encryption algorithm can effectively decrease the correlation coefficient and make it extremely close to 0. Figure 15 shows the adjacent pixel correlation distribution of plain images and corresponding cipher images. As is shown in Figure 15, the correlation distribution of plain images is concentrated near the diagonal of the histogram, and the adjacent values of the corresponding cipher image are uniformly distributed in the histogram. Table 10 lists the correlation coefficient of different plain images and corresponding cipher images. Table 11 illustrates the comparison results of different algorithms with respect to the correlation coefficient of the Pepper image. Table 12 compares the performance of the correlation coefficient of Lena image with different algorithms. From the comparison results of Figure 16 and Figure 17, it can be concluded that the correlation coefficient of the proposed algorithm has better performance than that of other similar algorithms. As a consequence, the proposed algorithm can effectively prevent statistical attacks.

5.3.3. χ 2 Test

The chi-squared ( χ 2 ) test reflects the quantized distribution of the image pixel distribution, which corresponds to the uniformity of the image histogram. A smaller chi-square value indicates a more uniform image histogram. The mathematical definition is as follows:
χ 2 = l = 0 k ( O l f e ) 2 f e
f e = M × N / 256
where k = 255, O l denotes the actual observed frequency of occurrence of each gray level, f e stands for the frequency of prediction. Table 13 illustrates the results of the chi-squared test and comparison with other similar algorithms. It can be reflected that the proposed algorithm has better image encryption performance.

5.3.4. Information Entropy Analysis

The information entropy of an image is generally used to measure the amount of information contained in an image. The maximum value of information entropy is 8. The mathematical definition of information entropy is as follows:
Q = i = 0 L ρ ( a i ) log 2 ρ ( a i )
where ρ ( a i ) denotes the probability of occurrence of pixel a i and L = 255. Table 14 lists the information entropies of different images and comparison results with other similar algorithms. It can be seen from Table 14 that the values of information entropies are extremely approximate 8, and the proposed algorithm has higher information entropies than that of other similar algorithms. Therefore, the proposed algorithm possesses enough security to defend against entropy attacks.

5.3.5. MSE and PSNR Analysis

The Mean Square Error (MSE) and peak signal-to-noise ratio are common metrics to evaluate the effect of image encryption. MSE and PSNR are defined as follows:
M S E = 1 S i = 1 M j = 1 N ( ρ ( i , j ) ς ( i , j ) ) 2
P S N R = 10 log 10 ( L 2 M S E )
where M stands for the height of the image, and N stands for the width of the image, S = M × N. L = 255 represents the maximum gray level of the image. ρ ( i , j ) denotes the original image and ς ( i , j ) denotes the cipher image or the encrypted image. For cipher images, a higher MSE value indicates a better image encryption effect, and a lower value of PSNR is better. For decrypted images, the value of PSNR represents the similarity between the decrypted image and the original image. MSE of the cipher image and PSNR of the cipher image and decrypted image are shown in Table 15.
As is shown in Table 15, the proposed algorithm has higher MSE value and lower PSNR value than the other similar methods. The infinite PSNR value of the decrypted image indicates that the decrypted image is completely equivalent to the original image, which proves that the proposed algorithm is a lossless image algorithm.

5.3.6. Randomness Test

The randomness of the key in the image encryption process is directly related to image security, which is an important indicator of the security of the cryptosystem. We use the NIST SP800-22 test tool for randomness testing, which contains 16 test items. The p value of each item should be between 0.01 and 1 in the case of the pass.
In this paper, we test the randomness of the encryption key (KM, KE, KP, KX). The results of the NIST test are listed in Table 16. As is shown in Table 16, the full 16 NIST tests were passed, which proves that the encryption keys have good randomness.

5.4. Differential Attack Analyses

The attacker obtains key clues by comparing the difference between the original cipher image and the cipher image that fine-tunes the pixels of the original plain image, which is called differential attack. The Number of Pixels Change Rate (NPCR) and Unified Average Changing Intensity (UACI) are commonly used metrics to evaluate cryptosystems against differential attacks. The ideal values of NPCR and UACI are 99.6094% and 33.4635%. The mathematical expression is as follows:
N P C R ( λ 1 , λ 2 ) = u v D ( u , v ) W × H × 100 %
D ( u , v ) = 0 , λ 1 ( u , v ) = λ 2 ( u , v ) 1 , λ 1 ( u , v ) λ 2 ( u , v )
U A C I ( λ 1 , λ 2 ) = 1 W × H u v λ 1 ( u , v ) λ 2 ( u , v ) L max × 100 %
where W and H stand for the width and height of the image, respectively, and L max = 255 represents the maximum gray level of the image. Furthermore, λ 1 denotes the original cipher image, and λ 2 represents the cipher image corresponding to changing the pixel of the plain image. From Table 17, it can be concluded that the values of NPCR and UACI are all extremely close to the ideal values, and our algorithm possesses better performance compared with other similar algorithms.

5.5. Encryption Quality Analyses

5.5.1. Encryption Quality (EQ)

Encryption Quality (EQ) is often used to describe the difference between the cipher image and the original image, which can be defined as follows:
E Q = i = 0 L h p i h c i / ( L + 1 )
where L = 256 denotes 256 grayscale levels, and h p i and h c i denote the sequence of occurrence of gray value i of plain image and cipher image. The larger the difference degree, the better the image encryption quality. Table 18 lists the EQ value of different images. Table 19 demonstrates the result comparing EQ values. As shown in Table 19, the proposed algorithm obtains higher a EQ value than other similar algorithms. Therefore, our algorithm performs better image encryption quality.

5.5.2. Maximum Deviation (MD)

The maximum deviation is used to reflect maximum variance between the plain image and cipher image; similar to EQ, a higher value indicates a better image encryption effect of the image. MD is defined as follows:
M D = h p 0 h c 0 + h p 255 h c 255 2 + i = 1 254 h p i h c i
where h p i denotes the sequence of occurrence of gray value i of the plain image, h c i represents the sequence of occurrence of gray value i of cipher image. The MD values of different images are shown in Table 20, and the comparison results of MD values are illustrated in Table 21. The experiment results demonstrate that the proposed encryption algorithm has a better image encryption effect than other algorithms.

5.6. Robustness Analyses

A robust image encryption algorithm is still able to ensure that the decrypted image is identifiable in the environment of cropping and noise attacks, which proves that the algorithm has good robustness.

5.6.1. Cropping Attack Analysis

When the image is under cropping attack, the decryption image quality will be affected. As a result, it is necessary to analyze the impact of cropping attack on decrypted image quality. In the experiment, we choose to mask part of the pixels of the cipher image and set the pixel value at the mask to 0, then we decrypted the masked cipher image. The cipher images with different cropping ratios (1/16, 1/4, 1/2, 3/4) and the corresponding decrypted images are shown in Figure 16. As is shown in Figure 16, when the cipher image is cropped by 1/16, 1/4 and 1/2, most of the effective information of the image can still be decrypted; even if the ciphertext image is cropped by 3/4, the salient contour features in the corresponding decrypted ciphertext image can still be identified. As a consequence, the proposed algorithm can effectively resist the cropping attack.

5.6.2. Noise Attack Analysis

In the process of image transmission, it is inevitable to be affected by noise. An excellent image encryption algorithm should ensure that the decrypted image is still identifiable in the case of noise attacks and avoid the image sender having to re-send the image to improve the efficiency of image transmission. Figure 17 illustrates the cipher images and corresponding decrypted images after adding different proportions (5%, 10%, 20%, 50%) of salt and pepper noise. As is shown in Figure 17, when 5%, 10% or 20% salt and pepper noise is added to the ciphertext image, the quality of the decrypted image is degraded, but the effective information in the image is only slightly affected. Even if the proportion reaches 50%, the overall contour information of the decrypted image is still recognizable. Therefore, our algorithm can efficiently defend against noise attack.

5.6.3. Classical Attack Analysis

There are the following four types of attack patterns in cryptology.
Known-plaintext attack: The attacker steals part of the plaintext information and corresponding ciphertext information and obtains the key by analyzing the relationship between the known plaintext and ciphertext.
Ciphertext-only attack: The attacker only obtains the decrypted information (ciphertext information) to attack.
Chosen-plaintext attack: The attacker not only knows the encryption algorithm but also can construct specific ciphertext information. As the system can construct arbitrary ciphertext information, the attacker can obtain the key used by the cryptosystem more quickly and efficiently.
Chosen-ciphertext attack: The attacker not only knows the decryption algorithm but also can construct specific plaintext information.
Among these four attack modes, chosen plaintext attack is the most effective pattern. If a cryptosystem can defend against one chosen plaintext attack, it can naturally resist the other three attack modes.
The proposed algorithm uses SHA-256 to generate 32 decimal hash values related to the plaintext, and these 32 hash values are used to determine the initial value of the hyper-chaotic system, as well as the four convolution kernels of the convolutional neural network. At the same time, the convolutional neural network is used to generate convolution sequences for controlling the process of DNA strand permutation. Therefore, different images will generate different hyper-chaotic sequences and convolution sequences, which will lead to different encryption and decryption results. In other words, our algorithm is a complete one-time pad encryption and decryption system, which can efficiently defend against the chosen-plaintext attack and the other three attacks above.

5.7. Encryption Efficiency Analyses

5.7.1. Execution Time Analysis

Algorithm execution time is an essential index to measure the performance and efficiency of the cryptosystem. An excellent image encryption algorithm can ensure security while requiring as little execution time as possible. The comparison result of execution time analysis is shown in Table 22. Above all, Table 22 lists the execution times of encryption and decryption for three different sizes of images; our algorithm shows shorter encryption and decryption times than the algorithm in [22]. In addition, we also compare the encryption time of the size of the 512 × 512 image with the other similar method in [50,51,52,53], which also demonstrate the efficiency of the proposed algorithm compared with other similar algorithms. At the same time, the execution time of every image encryption step is listed in Table 23. As is shown in Table 23, hyper-chaotic and convolution sequences generation steps account for 60% of the total execution time. However, the DNA strand generation step and DNA strand permutation and diffusion steps only take up 5% and 6% of the total time, which demonstrates the efficiency of the bit-plane decomposition method to generate DNA strands and the DNA scrambling and diffusion operations.

5.7.2. Time Complexity Analysis

Time complexity analysis is obtained by summing the time complexity of each major encryption process. m × n stands for the total number of pixels. The major encryption processes for calculating the time complexity include hyper-chaotic and convolution sequence generation, DNA strand generation, DNA strand permutation, DNA strand diffusion, DNA strand encoding and decoding and bit-plane combined. The time complexity of hyper-chaotic and convolution sequence generation is O (10 × m × n). For the DNA strand generation, the bit-plane decomposition is essentially a subprocess, and the time complexity is O (4 × m × n). The time complexity of DNA strand permutation is O (4 × m × n). The time complexity of DNA strand diffusion is O (4 × m × n). The time complexity of DNA strand diffusion is O(4 × m × n). For the DNA strand encoding and decoding, the time complexity is O (4 × m × n). In addition, the bit-plane combination first converts the DNA strands into binary sequences, then splits the sequences and finally merges them. The time complexity of bit-plane combination is O (m × n). As a consequence, the overall time complexity is O (m × n), which is less than O (37 × m × n) and O (78 × m × n) in [24].

6. Conclusions

In this paper, a DNA encoding image encryption algorithm based on convolution is proposed. We designed a novel DNA strand generation method based on bit-plane decomposition and DNA encoding. According to the operation rules of DNA operation, we construct seven DNA operation index tables. By retrieving the index table, the DNA operation process is simplified and accelerated, which ensures the diffusion efficiency of the DNA strand and the effect of image encryption. Simulation results and experimental analysis show that the proposed encryption scheme exhibits superior security, effectiveness and robustness.
Although the five-dimensional Hamiltonian conservative chaotic system has good dynamic behavior, its chaotic sequence generation time accounts for 59% of the total execution time, which still has huge room for improvement. In future work, we will explore more efficient chaotic sequence generation schemes to further improve the encryption efficiency of the cryptosystem.

Author Contributions

The authors confirm their contribution to the paper as follows: Conceptualization, L.H. and C.D.; methodology, C.D.; software, C.D.; validation, L.H., C.W. and Z.B.; formal analysis, L.H.; investigation, L.H.; resources, H.C.; data curation, L.H.; writing—original draft preparation, L.H.; writing—review and editing, C.D.; visualization, L.H.; supervision, H.C.; project administration, L.H.; funding acquisition, C.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Key Laboratory of Specialty Fiber Optics and Optical Access Networks, grant number SKLSFO2024-04.

Data Availability Statement

The data presented in this study are available on request from the corresponding author due to privacy.

Acknowledgments

The authors would like to thank the editor and anonymous reviewers for their valuable comments that helped to improve this paper.

Conflicts of Interest

Author Haitao Chen was employed by the company Hunan Zhentong Zhiyong Artificial Intelligence Technology Co., Ltd. The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

References

  1. Lorenz, E.N. Deterministic nonperiodic flow. J. Atmos. Sci. 1963, 20, 130–141. [Google Scholar] [CrossRef]
  2. Tufillaro, N.B. Nonlinear and chaotic string vibrations. Am. J. Phys. 1989, 57, 408–414. [Google Scholar] [CrossRef]
  3. Matthews, R. On the derivation of a “chaotic” encryption algorithm. Cryptologia 1989, 13, 29–42. [Google Scholar] [CrossRef]
  4. Jain, A.; Rajpal, N. A robust image encryption algorithm resistant to attacks using DNA and chaotic logistic maps. Multimed. Tools Appl. 2015, 75, 5455–5472. [Google Scholar] [CrossRef]
  5. Chai, X.-L.; Gan, Z.-H.; Lu, Y.; Zhang, M.-H.; Chen, Y.-R. A novel color image encryption algorithm based on genetic recombination and the four-dimensional memristive hyperchaotic system. Chin. Phys. B 2016, 25, 100503. [Google Scholar] [CrossRef]
  6. Wu, X.; Wang, D.; Kurths, J.; Kan, H. A novel lossless color image encryption scheme using 2D DWT and 6D hyperchaotic system. Inf. Sci. 2016, 349, 137–153. [Google Scholar] [CrossRef]
  7. Shakir, H.R. An image encryption method based on selective AES coding of wavelet transform and chaotic pixel shuffling. Multimed. Tools Appl. 2019, 78, 26073–26087. [Google Scholar] [CrossRef]
  8. Gong, L.; Qiu, K.; Deng, C.; Zhou, N. An image compression and encryption algorithm based on chaotic system and compressive sensing. Opt. Laser Technol. 2019, 115, 257–267. [Google Scholar] [CrossRef]
  9. Wang, H.; Xiao, D.; Li, M.; Xiang, Y.; Li, X. A visually secure image encryption scheme based on parallel compressive sensing. Signal Process. 2019, 155, 218–232. [Google Scholar] [CrossRef]
  10. Xu, Q.; Sun, K.; Cao, C.; Zhu, C. A fast image encryption algorithm based on compressive sensing and hyperchaotic map. Opt. Lasers Eng. 2019, 121, 203–214. [Google Scholar] [CrossRef]
  11. Luo, Y.; Tang, S.; Liu, J.; Cao, L.; Qiu, S. Image encryption scheme by combining the hyper-chaotic system with quantum coding. Opt. Lasers Eng. 2020, 124, 105836. [Google Scholar] [CrossRef]
  12. Huang, H.; Yang, S.; Ye, R. Efficient symmetric image encryption by using a novel 2D chaotic system. IET Image Process. 2020, 14, 1157–1163. [Google Scholar] [CrossRef]
  13. Hua, Z.; Zhang, K.; Li, Y.; Zhou, Y. Visually secure image encryption using adaptive-thresholding sparsification and parallel compressive sensing. Signal Process. 2021, 183, 107998. [Google Scholar] [CrossRef]
  14. Hua, Z.; Li, J.; Chen, Y.; Yi, S. Design and application of an S-box using complete Latin square. Nonlinear Dyn. 2021, 104, 807–825. [Google Scholar] [CrossRef]
  15. Zou, C.; Wang, X.; Zhou, C.; Xu, S.; Huang, C. A novel image encryption algorithm based on DNA strand exchange and diffusion. Appl. Math. Comput. 2022, 430, 127291. [Google Scholar] [CrossRef]
  16. Liu, X.; Tong, X.; Zhang, M.; Wang, Z.; Fan, Y. Image compression and encryption algorithm based on uniform non-degeneracy chaotic system and fractal coding. Nonlinear Dyn. 2023, 111, 8771–8798. [Google Scholar] [CrossRef]
  17. Dong, E.; Yuan, M.; Du, S.; Chen, Z. A new class of Hamiltonian conservative chaotic systems with multistability and design of pseudo-random number generator. Appl. Math. Model. 2019, 73, 40–71. [Google Scholar] [CrossRef]
  18. Dong, Q.; Zhou, S.; Zhang, Q.; Kasabov, N.K. A class of 5D Hamiltonian conservative hyperchaotic systems with symmetry and multistability. Nonlinear Dyn. 2022, 110, 2889–2912. [Google Scholar] [CrossRef]
  19. Man, Z.; Li, J.; Di, X.; Sheng, Y.; Liu, Z. Double image encryption algorithm based on neural network and chaos. Chaos Solitons Fractals 2021, 152, 111318. [Google Scholar] [CrossRef]
  20. Patel, S.; Bharath, K.P.; Rajesh Kumar, M. Symmetric keys image encryption and decryption using 3D chaotic maps with DNA encoding technique. Multimed. Tools Appl. 2020, 79, 31739–31757. [Google Scholar] [CrossRef]
  21. Wang, X.; Zhao, M. An image encryption algorithm based on hyperchaotic system and DNA coding. Opt. Laser Technol. 2021, 143, 107316. [Google Scholar] [CrossRef]
  22. Jasra, B.; Hassan Moon, A. Color image encryption and authentication using dynamic DNA encoding and hyper chaotic system. Expert Syst. Appl. 2022, 206, 117861. [Google Scholar] [CrossRef]
  23. Wang, Q.Y.; Zhang, X.Q.; Zhao, X.H. Image encryption algorithm based on improved Zigzag transformation and quaternary DNA coding. J. Inf. Secur. Appl. 2022, 70, 18. [Google Scholar] [CrossRef]
  24. Elizabeth, B.L.; Gayathri, J.; Subashini, S.; Prakash, A.J. HIDE: Hyperchaotic image encryption using DNA computing. J. Real-Time Image Process. 2022, 19, 429–443. [Google Scholar] [CrossRef]
  25. Liu, Y.; Zhang, J. A Multidimensional Chaotic Image Encryption Algorithm based on DNA Coding. Multimed. Tools Appl. 2020, 79, 21579–21601. [Google Scholar] [CrossRef]
  26. Yu, W.; Liu, Y.; Gong, L.; Tian, M.; Tu, L. Double-image encryption based on spatiotemporal chaos and DNA operations. Multimed. Tools Appl. 2019, 78, 20037–20064. [Google Scholar] [CrossRef]
  27. Lin, R.; Li, S.; Tan, Z. An Image Encryption Scheme Based on Lorenz Hyperchaotic System and RSA Algorithm. Secur. Commun. Netw. 2021, 2021, 5586959. [Google Scholar] [CrossRef]
  28. Zhang, Y.Q.; Wang, X.Y. A symmetric image encryption algorithm based on mixed linear–nonlinear coupled map lattice. Inf. Sci. 2014, 273, 329–351. [Google Scholar] [CrossRef]
  29. Ye, G.; Wu, H.; Jiao, K.; Mei, D. Asymmetric image encryption scheme based on the Quantum logistic map and cyclic modulo diffusion. Math. Biosci. Eng. 2021, 18, 5427–5448. [Google Scholar] [CrossRef]
  30. Patro, K.A.K.; Soni, A.; Netam, P.K.; Acharya, B. Multiple grayscale image encryption using cross-coupled chaotic maps. J. Inf. Secur. Appl. 2020, 52, 102470. [Google Scholar] [CrossRef]
  31. Shengtao, G.; Tao, W.; Shida, W.; Xuncai, Z.; Ying, N. A Novel Image Encryption Algorithm Based on Chaotic Sequences and Cross-Diffusion of Bits. IEEE Photonics J. 2021, 13, 3900215. [Google Scholar] [CrossRef]
  32. Roy, M.; Chakraborty, S.; Mali, K.; Roy, D.; Chatterjee, S. A robust image encryption framework based on DNA computing and chaotic environment. Microsyst. Technol. 2021, 27, 3617–3627. [Google Scholar] [CrossRef]
  33. Zhang, Y.-Q.; Huang, H.-F.; Wang, X.-Y.; Huang, X.-H. A secure image encryption scheme based on genetic mutation and MLNCML chaotic system. Multimed. Tools Appl. 2021, 80, 19291–19305. [Google Scholar] [CrossRef]
  34. Hu, G.; Li, B. A uniform chaotic system with extended parameter range for image encryption. Nonlinear Dyn. 2021, 103, 2819–2840. [Google Scholar] [CrossRef]
  35. Wang, T.; Wang, M.-h. Hyperchaotic image encryption algorithm based on bit-level permutation and DNA encoding. Opt. Laser Technol. 2020, 132, 106355. [Google Scholar] [CrossRef]
  36. Alghafis, A.; Firdousi, F.; Khan, M.; Batool, S.I.; Amin, M. An efficient image encryption scheme based on chaotic and Deoxyribonucleic acid sequencing. Math. Comput. Simul. 2020, 177, 441–466. [Google Scholar] [CrossRef]
  37. Wang, X.; Feng, L.; Zhao, H. Fast image encryption algorithm based on parallel computing system. Inf. Sci. 2019, 486, 340–358. [Google Scholar] [CrossRef]
  38. Wang, X.; Liu, C.; Xu, D.; Liu, C. Image encryption scheme using chaos and simulated annealing algorithm. Nonlinear Dyn. 2016, 84, 1417–1429. [Google Scholar] [CrossRef]
  39. Wang, X.; Liu, P. Image encryption based on roulette cascaded chaotic system and alienated image library. Vis. Comput. 2021, 38, 763–779. [Google Scholar] [CrossRef]
  40. Zheng, J.; Hu, H. A symmetric image encryption scheme based on hybrid analog-digital chaotic system and parameter selection mechanism. Multimed. Tools Appl. 2021, 80, 20883–20905. [Google Scholar] [CrossRef]
  41. Zhang, Q.; Han, J.; Ye, Y. Multi-image encryption algorithm based on image hash, bit-plane decomposition and dynamic DNA coding. IET Image Process. 2021, 15, 885–896. [Google Scholar] [CrossRef]
  42. Shakiba, A. A novel randomized bit-level two-dimensional hyperchaotic image encryption algorithm. Multimed. Tools Appl. 2020, 79, 32575–32605. [Google Scholar] [CrossRef]
  43. Zhang, Y. The unified image encryption algorithm based on chaos and cubic S-Box. Inf. Sci. 2018, 450, 361–377. [Google Scholar] [CrossRef]
  44. Gayathri, J.; Subashini, S. A spatiotemporal chaotic image encryption scheme based on self adaptive model and dynamic keystream fetching technique. Multimed. Tools Appl. 2018, 77, 24751–24787. [Google Scholar] [CrossRef]
  45. Wang, X.; Zhang, M. An image encryption algorithm based on new chaos and diffusion values of a truth table. Inf. Sci. 2021, 579, 128–149. [Google Scholar] [CrossRef]
  46. Farah, M.; Guesmi, R.; Kachouri, A.; Samet, M. A new design of cryptosystem based on S-box and chaotic permutation. Multimed. Tools Appl. 2020, 79, 19129–19150. [Google Scholar] [CrossRef]
  47. Ahmed, F.; Anees, A.; Abbas, V.U.; Siyal, M.Y. A Noisy Channel Tolerant Image Encryption Scheme. Wirel. Pers. Commun. 2014, 77, 2771–2791. [Google Scholar] [CrossRef]
  48. Anees, A.; Siddiqui, A.M.; Ahmed, F. Chaotic substitution for highly autocorrelated data in encryption algorithm. Commun. Nonlinear Sci. Numer. Simul. 2014, 19, 3106–3118. [Google Scholar] [CrossRef]
  49. Yousif, S.F.; Abboud, A.J.; Alhumaima, R.S. A new image encryption based on bit replacing, chaos and DNA coding techniques. Multimed. Tools Appl. 2022, 81, 27453–27493. [Google Scholar] [CrossRef]
  50. Huang, Z.-W.; Zhou, N.-R. Image encryption scheme based on discrete cosine Stockwell transform and DNA-level modulus diffusion. Opt. Laser Technol. 2022, 149, 107879. [Google Scholar] [CrossRef]
  51. Yan, X.; Wang, X.; Xian, Y. Chaotic image encryption algorithm based on arithmetic sequence scrambling model and DNA encoding operation. Multimed. Tools Appl. 2021, 80, 10949–10983. [Google Scholar] [CrossRef]
  52. Wang, X.; Zhang, M. A new image encryption algorithm based on ladder transformation and DNA coding. Multimed. Tools Appl. 2021, 80, 13339–13365. [Google Scholar] [CrossRef]
  53. ElKamchouchi, D.H.; Mohamed, H.G.; Moussa, K.H. A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion. Entropy 2020, 22, 180. [Google Scholar] [CrossRef] [PubMed]
Figure 1. The chaotic attractor of 5D Harmiltonian conservative hyper-chaotic system: (a) X-Y phase space; (b) Y-Z phase space; (c) Z-W phase space; (d) W-N phase space; (e) X-Y-Z phase space; (f) X-Y-W phase space; (g) Y-Z-W phase space; (h) Z-W-N phase space.
Figure 1. The chaotic attractor of 5D Harmiltonian conservative hyper-chaotic system: (a) X-Y phase space; (b) Y-Z phase space; (c) Z-W phase space; (d) W-N phase space; (e) X-Y-Z phase space; (f) X-Y-W phase space; (g) Y-Z-W phase space; (h) Z-W-N phase space.
Mathematics 13 01330 g001aMathematics 13 01330 g001b
Figure 2. Bit-plane decomposition result of Image Boat. (ad): low-bit-planes; (eh): high-bit-planes.
Figure 2. Bit-plane decomposition result of Image Boat. (ad): low-bit-planes; (eh): high-bit-planes.
Mathematics 13 01330 g002
Figure 3. Plaintext-related sequence generator.
Figure 3. Plaintext-related sequence generator.
Mathematics 13 01330 g003
Figure 4. The flowchart of DNA strand generation.
Figure 4. The flowchart of DNA strand generation.
Mathematics 13 01330 g004
Figure 5. An example of DNA strand generation process.
Figure 5. An example of DNA strand generation process.
Mathematics 13 01330 g005
Figure 6. An example of DNA strand permutation process.
Figure 6. An example of DNA strand permutation process.
Mathematics 13 01330 g006
Figure 7. An example of DNA strand diffusion process.
Figure 7. An example of DNA strand diffusion process.
Mathematics 13 01330 g007
Figure 8. Image encryption process.
Figure 8. Image encryption process.
Mathematics 13 01330 g008
Figure 9. Image decryption process.
Figure 9. Image decryption process.
Mathematics 13 01330 g009
Figure 10. Encryption results of Group 1: (a) clock (256 × 256); (b) bridge (512 × 512); (c) boat (512 × 512); (d) male (1024 × 1024). First line: plain images; second line: encrypted images; third line: decrypted images.
Figure 10. Encryption results of Group 1: (a) clock (256 × 256); (b) bridge (512 × 512); (c) boat (512 × 512); (d) male (1024 × 1024). First line: plain images; second line: encrypted images; third line: decrypted images.
Mathematics 13 01330 g010
Figure 11. Encryption results of Group 2: (a) female (256 × 256 × 3); (b) pine (256 × 256 × 3); (c) house (512 × 512 × 3); (d) fighter (512 × 512 × 3). First line: plain images; second line: encrypted images; third line: decrypted images.
Figure 11. Encryption results of Group 2: (a) female (256 × 256 × 3); (b) pine (256 × 256 × 3); (c) house (512 × 512 × 3); (d) fighter (512 × 512 × 3). First line: plain images; second line: encrypted images; third line: decrypted images.
Mathematics 13 01330 g011
Figure 12. Key sensitivity experiment: (a) cipher image “Boat”; (bf) use incorrect key to decrypt: x 0 + 10 16 , y 0 + 10 16 , z 0 + 10 16 , w 0 + 10 16 , v 0 + 10 16 ; (g) use correct key to decrypt.
Figure 12. Key sensitivity experiment: (a) cipher image “Boat”; (bf) use incorrect key to decrypt: x 0 + 10 16 , y 0 + 10 16 , z 0 + 10 16 , w 0 + 10 16 , v 0 + 10 16 ; (g) use correct key to decrypt.
Mathematics 13 01330 g012
Figure 13. Cipher image difference (“Boat”). (ae): cipher image using x 0 , y 0 , z 0 , w 0 , v 0 ; (fj): cipher image using x 0 + 10 16 , y 0 + 10 16 , z 0 + 10 16 , w 0 + 10 16 , v 0 + 10 16 ; (ko): difference between cipher images (ae) and cipher images (fj).
Figure 13. Cipher image difference (“Boat”). (ae): cipher image using x 0 , y 0 , z 0 , w 0 , v 0 ; (fj): cipher image using x 0 + 10 16 , y 0 + 10 16 , z 0 + 10 16 , w 0 + 10 16 , v 0 + 10 16 ; (ko): difference between cipher images (ae) and cipher images (fj).
Mathematics 13 01330 g013
Figure 14. Image 3D histogram. (a,e,i,m,q,u): plain images; (b,f,j,n,r,v): 3D histograms of plain images; (c,g,k,o,s,w): cipher images; (d,h,l,p,t,x): 3D histograms of cipher images.
Figure 14. Image 3D histogram. (a,e,i,m,q,u): plain images; (b,f,j,n,r,v): 3D histograms of plain images; (c,g,k,o,s,w): cipher images; (d,h,l,p,t,x): 3D histograms of cipher images.
Mathematics 13 01330 g014aMathematics 13 01330 g014b
Figure 15. Adjacent pixel correlation distribution. (a): plain images; (b): correlation distribution of plain images; (c): corresponding cipher images; (d): correlation distribution of cipher images.
Figure 15. Adjacent pixel correlation distribution. (a): plain images; (b): correlation distribution of plain images; (c): corresponding cipher images; (d): correlation distribution of cipher images.
Mathematics 13 01330 g015
Figure 16. The results of the cropping attacks: (ad) cipher image of 1/16, 1/4, 1/2, 3/4 cropping attacks; (eh) corresponding decrypted image of different cropping attacks.
Figure 16. The results of the cropping attacks: (ad) cipher image of 1/16, 1/4, 1/2, 3/4 cropping attacks; (eh) corresponding decrypted image of different cropping attacks.
Mathematics 13 01330 g016
Figure 17. The results of the noise attacks: (ad) cipher image of 0.05, 0.1, 0.2, 0.5 noise attacks; (eh) corresponding decrypted image of different noise attacks.
Figure 17. The results of the noise attacks: (ad) cipher image of 0.05, 0.1, 0.2, 0.5 noise attacks; (eh) corresponding decrypted image of different noise attacks.
Mathematics 13 01330 g017
Table 1. The calculation result of proportion of information carried.
Table 1. The calculation result of proportion of information carried.
Bit-Planes1th2th3th4th5th6th7th8th
Proportion (%)0.390.781.573.146.2712.5525.1050.20
5.8894.12
Table 2. DNA encoding and decoding rules.
Table 2. DNA encoding and decoding rules.
Rule12345678
00AATTGGCC
01GCGCATAT
10CGCGTATA
11TTAACCGG
Table 3. DNA arithmetic operations.
Table 3. DNA arithmetic operations.
⊕/⊗/+/−AGCT
AA/T/A/AG/C/G/TC/G/C/CT/A/T/G
GG/C/G/GA/T/C/AT/A/T/TC/G/A/C
CC/G/C/CT/A/T/GA/T/A/AG/C/G/T
TT/A/T/TC/G/A/CG/C/G/GA/T/C/A
Table 4. Key space comparison.
Table 4. Key space comparison.
Proposed[24][23][25][26][19][27]
Key space 2 797 2 711 2 512 2 328 2 777 2 691 2 500
Table 5. Difference between two cipher images.
Table 5. Difference between two cipher images.
Cipher ImagesKeyDifference (%)
Figure 13aFigure 13f x 0 x 0 + 10 16 99.46
Figure 13bFigure 13g y 0 y 0 + 10 16 99.60
Figure 13cFigure 13h z 0 z 0 + 10 16 99.62
Figure 13dFigure 13i w 0 w 0 + 10 16 99.50
Figure 13eFigure 13j v 0 v 0 + 10 16 99.67
Table 6. Variances of histograms.
Table 6. Variances of histograms.
ImageClockBridgeBoatMale
Plain283,167.6864,761,071.3251,541,901.80411,393,958.533
Cipher332.463902.086953.7653818.102
Table 7. Variances of histograms with different keys.
Table 7. Variances of histograms with different keys.
Cipher ImageKey α β γ σ δ ϕ ψ φ χ θ
Bridge902.086885.467974.031986.126887.224850.361965.992928.494869.106940.251961.851
Boat953.7651026.784874.314968.047975.9371022.620982.737973.7021024.275908.2671027.388
Couple1036.4781004.761945.2471001.6551088.9801031.922994.8001078.5491136.6591055.2711008.400
Tank1003.6391043.3331083.9061110.7061044.965988.3291053.3251009.7411034.439928.8161035.663
Average973.992990.086969.3751016.634999.276973.308999.214997.6221016.120958.1511008.325
Table 8. Variance change rate of different keys.
Table 8. Variance change rate of different keys.
Cipher Image α β γ σ δ ϕ ψ φ χ θ
Bridge1.84%7.98%9.32%1.65%5.73%7.08%2.93%3.66%4.23%6.63%
Boat7.66%8.33%1.50%2.32%7.22%3.04%2.09%7.39%4.77%7.72%
Couple3.06%8.80%3.36%5.07%0.44%4.02%4.06%9.67%1.81%2.71%
Tank3.96%8.00%10.67%4.12%1.53%4.95%0.61%3.07%7.46%3.19%
Average1.65%0.47%4.38%2.60%0.07%2.59%2.43%4.33%1.63%3.53%
Table 9. Comparison of histogram variances.
Table 9. Comparison of histogram variances.
MethodsLenaBarbaraPeppersMale
Proposed982.808986.345959.6713818.102
[24]993.5701042.672967.3674020.578
[28]1047.655941.168--
[29]5335.835013.88--
Table 10. Correlation coefficients of different images.
Table 10. Correlation coefficients of different images.
ImagesPlain ImageCipher Image
HVDHVD
Clock0.956320.972190.937900.00383−0.000070.00606
Bridge0.940460.919620.89272−0.00496−0.002990.00538
Boat0.934460.971530.920950.00660−0.00848−0.00036
Male0.979440.979100.964000.00154−0.004180.00716
Couple0.934190.881030.848190.00762−0.002730.00162
Tank0.943440.930470.897390.00304−0.006600.00528
Lena0.967740.985330.95554−0.00109−0.000390.00007
Peppers0.972000.977810.955250.00027−0.00042−0.00076
Table 11. Correlation coefficients comparison of Peppers image.
Table 11. Correlation coefficients comparison of Peppers image.
AlgorithmsCipher Image
HVD
Proposed0.00027−0.00042−0.00076
[24]−0.0002−0.0029−0.0061
[21]0.0089−0.0037−0.0042
[30]0.01390.00540.0153
[31]−0.00130.00190.0009
Table 12. Correlation coefficients comparison of Lena image.
Table 12. Correlation coefficients comparison of Lena image.
AlgorithmsCipher Image
HVD
Proposed−0.00109−0.000390.00007
[32]−0.0020−0.00650.0087
[33]−0.0017−0.0009−0.0019
[34]−0.0239−0.00330.0046
[35]0.01150.01930.0234
[36]0.00850.00540.0049
[15]0.0004−0.0033−0.0070
Table 13. Comparison results of χ 2 test.
Table 13. Comparison results of χ 2 test.
AlgorithmsImages χ 2 Test
Plain ImageCipher Image
ProposedClock282,062244.914
Couple298,865247.254
Peppers120,166243.246
Male709,341194.333
Lena158,349185.645
Boat383,970255.762
Bridge1,185,618210.523
Tank2,025,900249.018
Baboon187,357254.293
[21]Peppers-264.77
[30]Peppers-287.22
[31]Peppers-271.90
[24]Peppers-253.08
[28]Peppers-247.56
[15]Lena-218
[32]Lena-229
[37]Lena-230
[38]Lena-230
[39]Lena-285
Table 14. Comparison results of information entropy.
Table 14. Comparison results of information entropy.
AlgorithmsImagesInformation Entropy
Plain ImageCipher Image
ProposedClock6.70577.9973
Couple7.20107.9993
Peppers7.59377.9994
Male7.52377.9999
Lena7.44517.9995
Boat7.19147.9993
Bridge5.70567.9994
Tank5.49577.9993
Baboon7.35837.9993
[15]Lena-7.9971
[25]Lena-7.9971
[40]Lena-7.9994
[41]Lena-7.9993
[28]Lena-7.9993
[24]Peppers-7.9993
[28]Peppers-7.9993
[15]Peppers-7.9993
[19]Peppers-7.9981
[25]Peppers-7.9971
Table 15. MSE and PSNR result.
Table 15. MSE and PSNR result.
AlgorithmsImageMSEPSNR
CipherDecrypted
proposedClock12,133.97.2791
Couple7090.19.6085
Peppers9428.48.3794
Male10,288.37.9977
Lena7754.29.2296
Boat7628.49.3065
Bridge8648.38.7615
Tank6213.110.1977
Baboon7285.19.5065
[24]Peppers9267.08.4614-
[24]Male10,294.68.0047-
[24]Couple7089.29.6248
[22]Peppers9311.78.4405-
[22]Lena7752.69.2363-
Table 16. NIST test.
Table 16. NIST test.
Test ItemsKey: KMKey: KEKey: KPKey: KX
Frequency test0.9914680.9223250.8633410.913568
Frequency test within a block0.3504850.3504850.4268430.269864
Cumulative sums test0.7399180.5341460.6348960.648576
Discrete fourier transform test0.8343080.6223250.7255630.268573
Test for the longest run of ones in a block0.9114130.8051890.4153710.897631
Random excursions variant test (x = 1)0.1842870.9114130.1856320.213547
Runs test0.6371190.0179120.2235750.168573
Non-overlapping template matching test (m = 9)0.9952530.7399180.2795630.245982
Overlapping template matching test (m = 9)0.9297030.9169050.9582540.987024
Maurer’s “Universal statistical” test0.6376830.7207740.5476350.635794
Approximate entropy test0.2313440.6586030.4465780.324359
Random excursions test (x = 1)0.9197080.7734460.3547830.738972
Serial test0.8332300.6304510.8857630.824629
Linear complexity test0.8889980.2133090.5147900.883671
Binary matrix rank test0.3504850.9563530.9658730.896542
Table 17. NPCR and UACI.
Table 17. NPCR and UACI.
AlgorithmsImageNPCR (%)UACI (%)
proposedClock99.612433.4044
Couple99.632633.4924
Peppers99.610133.4626
Male99.613233.4302
Lena99.621633.4556
Boat99.615933.4404
Bridge99.619733.4570
Tank99.580433.4169
Baboon99.614333.4834
[15]Lena99.624633.4115
[32]Lena99.606333.4477
[36]Lena99.63633.465
[42]Lena99.609633.4645
[41]Lena99.6533.61
[24]Peppers99.610133.4689
[30]Peppers99.608633.4398
[43]Peppers99.606833.4332
[44]Peppers99.608329.6188
[15]Peppers99.592233.3953
Table 18. EQ value of different images.
Table 18. EQ value of different images.
ImageClockCouplePeppersMaleLenaBoatBridgeTankBaboonAirplane
EQ value243.180868.469666.3362325.789664.695866.6641560.5231483.602775.0311083.617
Table 19. The comparison of EQ value.
Table 19. The comparison of EQ value.
AlgorithmsClockPeppersAirplane
Proposed243.180666.3361083
[24]2426081083
[45]244156303
[46]243156302
[47]243158300
Table 20. MD values of different images.
Table 20. MD values of different images.
ImageClockCouplePeppersMaleLenaBoatBridgeTankBaboonGirlCameraman
MD value62,006.5221,745.5144,003.5580,419169,140.5220,897.5398,970.5378,793.5197,37959,322.564,374
Table 21. Comparison results of MD values.
Table 21. Comparison results of MD values.
AlgorithmsCameramanBaboonGirl
Proposed64,374207,37959,322.5
[24]255,613201,30058,741
[46]63,92046,54049,588
[48]49,12917,65248,639
[49]38,91255,12939,187
Table 22. Comparison results of execution time analysis.
Table 22. Comparison results of execution time analysis.
AlgorithmImage SizeEncryption TimeDecryption TimePlatform & Hardware
Proposed256 × 2560.32800.3944MATLAB R2022a, CPU i7&2.80GHz, 8G RAM
512 × 5121.36501.5832
1024 × 10245.34466.6094
[22]256 × 2560.3800.463MATLAB R2020a, CPU i5&2.80GHz, 8G RAM
512 × 5121.4311.633
1024 × 10245.7196.759
[50]512 × 5121.6455-MATLAB R2013a, CPU i3&2.4 GHz, 4G RAM
[51]23.142-MATLAB R2018b, CPU i7&3.4 GHz, 8G RAM
[52]6.8816-MATLAB R2017a, CPU i5&2.3 GHz, 8G RAM
[53]6.0752-MATLAB R2017a, CPU i5&2.8 GHz, 8G RAM
Table 23. Execution time of every encryption step.
Table 23. Execution time of every encryption step.
StepsTime (/s)Percentage
Hyper-chaotic sequence generation0.801259%
Convolution sequence generation0.01781%
Bit-plane decomposition0.03322%
DNA strand generation0.06775%
DNA strand encoding0.05184%
DNA strand permutation0.06034%
DNA strand diffusion0.03142%
DNA strand decoding0.284121%
Bit-plane combination
Other0.01751%
Total1.3650100%
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Huang, L.; Ding, C.; Bao, Z.; Chen, H.; Wan, C. A DNA Encoding Image Encryption Algorithm Based on Chaos. Mathematics 2025, 13, 1330. https://doi.org/10.3390/math13081330

AMA Style

Huang L, Ding C, Bao Z, Chen H, Wan C. A DNA Encoding Image Encryption Algorithm Based on Chaos. Mathematics. 2025; 13(8):1330. https://doi.org/10.3390/math13081330

Chicago/Turabian Style

Huang, Li, Cong Ding, Zhenjie Bao, Haitao Chen, and Changsheng Wan. 2025. "A DNA Encoding Image Encryption Algorithm Based on Chaos" Mathematics 13, no. 8: 1330. https://doi.org/10.3390/math13081330

APA Style

Huang, L., Ding, C., Bao, Z., Chen, H., & Wan, C. (2025). A DNA Encoding Image Encryption Algorithm Based on Chaos. Mathematics, 13(8), 1330. https://doi.org/10.3390/math13081330

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop