Image encryption method based on DNA frameshift mutation

Abstract

The application discloses an image encryption method based on DNA shift mutation, and belongs to the field of information encryption. With the development of current internet technology, the network information transmission security problem is increasingly serious. In order to solve the network transmission and storage security problem of image content, the application provides an image encryption method based on DNA shift mutation. First, the original image is DNA encoded and converted into a DNA sequence; second, a DNA shift mutation operation is performed on the DNA sequence; finally, the DNA sequence after the DNA shift mutation is decoded, and an encryption image is generated by using chaos to perform XOR operation. The experimental results show that the method has strong security, good encryption effect and high efficiency, and can guarantee that the image information is not stolen in the network transmission process.

Description

Technical Field

[0001] This method relates to an information encryption technology, and in particular to an image encryption method. Background Technology

[0002] With the rapid development of internet technology, digital images, as an information carrier easily disseminated and stored on the network, play a vital role in information transmission due to their intuitiveness, vividness, and large information capacity. They are widely used in fields such as communications, military, medicine, and education. However, due to the inherent openness of internet platforms, solving the problem of image information leakage and decryption during transmission has become a significant challenge. Therefore, researching secure and efficient image encryption methods is crucial to prevent information leakage caused by unauthorized access or malicious attacks on images.

[0003] To protect the security of image transmission and storage over networks and improve image encryption efficiency, a DNA frameshift mutation-based image encryption method is proposed. This method utilizes DNA frameshift mutation, organically combining DNA computation with image encryption, and leverages chaotic sequences to fully diffuse the image, thereby enhancing both the security and efficiency of image encryption. Summary of the Invention

[0004] The purpose of this invention is to address the problems of insufficient encryption and low encryption efficiency in current image encryption methods by proposing an image encryption method based on DNA frameshift mutation.

[0005] The technical solution of this invention: To achieve the above-mentioned objective, the technical solution adopted is an image encryption method based on DNA frameshift mutation, where the sender is Alice and the receiver is Bob; Alice's encryption steps are detailed below: Step 1: Generate chaotic sequences: The Logistic mapping is defined as: x n+1 = u × x n ×(1- x n ), (1) Among them, the iteration value x n ∈(0, 1), control parameters u ∈(3.57, 4]; First, let the original image be P 1 Its size is m × n Randomly select the control parameters for the Logistic mapping. u 1 and initial value x 0, iterate formula (1) 1000+ timesm After discarding the first 1000 iterations, a length of [length missing] is obtained. m chaotic sequence X 1 ={ x 1 s Secondly, randomly select the control parameters for the Logistic mapping. u 2 and initial value y 0, iterate formula (1) 1000+ times n After discarding the first 1000 iterations, a length of [length missing] is obtained. n chaotic sequence Y 1 ={ y 1 t Finally, the control parameters for the Logistic mapping are randomly selected. u 3 and initial value z 0, iterate formula (1) 1000+ times m × n After discarding the first 1000 iterations, a length of [length missing] is obtained. m × n chaotic sequence Z 1 ={ z 1 k}; Step 2: Integerization of the chaotic sequence: computation, x 2 s = mod ( floor ( x 1 s ×10 16 ), 4× m × n -1)+1, s =1, 2, …, m , (2) y 2 t = mod ( floor ( y 1 t ×10 16 ), 4× m × n )+1, t =1, 2, …, n , (3) z2 k = mod ( floor ( z 1 k ×10 16 ), 256), k =1, 2, …, m × n , (4) in, mod (·) is the modulo operation function. floor (·) is the floor function. x 1 s ∈ X 1 , y 1 t ∈ Y 1 , z 1 k ∈ Z 1 This generates three strings with lengths of... m , n and m × n The integer chaotic sequence is X 2 ={ x 2 s}、 Y 2 ={ y 2 t}and Z 2 ={ z 2 k}; Step 3: Image DNA Encoding: 8 DNA Encoding Rules: Rule 1 r 1 is: 00 is encoded as A 11 is encoded as T 01 is encoded as G 10 is encoded as C The second DNA coding rule r 2 is: 00 is encoded as A 11 is encoded as T 10 is encoded as G 01 is encoded as C The third DNA coding rule r 3 is: 01 is encoded as A10 is encoded as T 00 is encoded as G 11 is encoded as C The fourth DNA coding rule r 4 is: 01 encoding is A 10 is encoded as T 11 is encoded as G 00 is encoded as C The fifth DNA coding rule r 5 is: 10 is encoded as A 01 is encoded as T 00 is encoded as G 11 is encoded as C The sixth DNA coding rule r 6 is: 10 is encoded as A 01 is encoded as T 11 is encoded as G 00 is encoded as C The 7th DNA coding rule r 7 is: 11 is encoded as A 00 is encoded as T 01 is encoded as G 10 is encoded as C The 8th DNA coding rule r 8 is: 11 is encoded as A 00 is encoded as T 10 is encoded as G 01 is encoded as C Randomly select a DNA coding rule r h , h ∈{1, 2, … 8}, for P 1 DNA encoding; P 1 Each pixel is 8 bits, which can be encoded into 4 bases, resulting in a 4×10^6 pixel. m × n DNA sequence D 1 ; Step 4: DNA frameshift mutation: First, use formulas (5)-(7) to... D 1 Perform DNA frameshift mutations, sequentially according to x 2 s ∈ X 2 The value, s =1, 2, …, m Randomly select DNA sequences D1 middle e Adjacent positions, e If it is not 3 or a multiple of 3, put this e The positions and the bases following them are uniformly shifted backward. e Then, insert the overflowing base at the end into the selected position. D 2 ( x 2 s : x 2 s + e -1)= D 1 (4× m × n - e +1:4× m × n ), (5) D 2 ( x 2 s + e :4× m × n )= D 1 ( x 2 s :4× m × n - e ), (6) D 1 (1:4× m × n )= D 2 (1:4× m × n ), (7) We can obtain a length of 4× m × n DNA sequence D 2 Secondly, using formulas (8)-(10) to... D 2 Perform DNA frameshift mutations, sequentially according to y 2 t ∈ Y 2 The value, t =1, 2, …, n Randomly select DNA sequencesD 2 one position q ∈{1, 2, …4× m × n},Will q The base at that position moves to the very beginning of the DNA sequence. D 3 (1)= D 2 ( y 2 t ), (8) D 3 (2: y 2 t )= D 2 (1: y 2 t -1), (9) D 2 (1:4× m × n )= D 3 (1:4× m × n ), (10) We can obtain a length of 4× m × n DNA sequence D 3 ; Step 5: DNA Decoding: Randomly select a DNA decoding rule. r h , h ∈{1, 2, … 8}, for D 3 DNA decoding is performed, and a sample of size [size missing] is generated in a specific manner. m × n Two-dimensional matrix P 2 =[ p 2 ij ]; Step 6: Image diffusion: Using formula (11) to diffuse the image. Z 2 Convert to a size of m × n Two-dimensional matrix W =[ w ij ]; W = reshape ( Z 2 , m , n ), (11) in, reshape (·) is the matrix dimension reconstruction function; then calculate: p 3 ij = p 2 ij ⊕ w ij , (12) in, i =1, 2, …, m ; j =1, 2, …, n ⊕ is the XOR operator. p 2 ij ∈ P 2 , z 3 ij ∈ Z 3 , to obtain a size of m × n Encrypted images P 3 =[ p 3 ij ].

[0006] During the decryption process, the same chaotic sequence is used to decrypt the image. P 3 Decryption can recover the original image. P 1 Bob's decryption process is the reverse of Alice's encryption process.

[0007] Beneficial effects: This invention addresses the shortcomings of existing image encryption methods, such as low encryption efficiency or weak security, by proposing an image encryption method based on DNA frameshift mutation. The main contributions are: (1) Organically combining DNA frameshift mutation with image encryption, enriching the types of DNA sequence operations in existing DNA encryption methods; (2) Encoding plaintext images with DNA, and utilizing the randomness of chaotic sequences to complete the DNA frameshift mutation operation; (3) Experimental results and algorithm analysis verify that the proposed method is highly secure and efficient, with good encryption effect, and can realize the secure network transmission and storage of image information. Attached Figure Description

[0008] Figure 1 Encryption flowchart; Figure 2 Original image; Figure 3 Schematic diagram of DNA frameshift mutation; Figure 4 Encrypted image. Detailed Implementation

[0009] The implementation process of the present invention will be further described in detail below with reference to specific accompanying drawings and examples.

[0010] Figure 1 This is the encryption flowchart of this method.

[0011] The programming software used was Matlab R2022b, and the 512×512 Baboon grayscale image shown in Figure 3 was selected as the original image. The proposed image encryption method based on DNA frameshift mutations was employed, and Alice's encryption process for the original image is detailed below.

[0012] Step 1: Generate a chaotic sequence: Let the original image be... P 1 Its size is 512×512. First, the control parameter 3.8952 and the initial value 0.1634 are randomly selected and iterated 1000+512 times according to formula (1). The first 1000 iterations are discarded to obtain a chaotic sequence of length 512. X 1 ={ x 1 s}; Secondly, the control parameter of the Logistic mapping, 3.9362, and the initial value, 0.8617, are randomly selected. Formula (1) is iterated 1000+512 times, and the first 1000 iterations are discarded to obtain a chaotic sequence of length 512. Y 1 ={ y 1 t Finally, the control parameter of the Logistic mapping, 3.9987, and the initial value, 0.3913, were randomly selected, and the formula (1) was iterated for 1000+ iterations. m × n After discarding the first 1000 iterations, a chaotic sequence of length 262144 is obtained. Z 1 ={ z 1 k}

[0013] Step 2: Integerization of Chaotic Sequences: Utilizing chaotic sequences X 1 , Y1 and Z 1 And formulas (2)-(4) generate three integer chaotic sequences of lengths 512, 512 and 262144 respectively. X 2 , Y 2 and Z 2 .

[0014] Step 3: Image DNA Encoding: Randomly select a DNA encoding rule r h , h ∈{1, 2, … 8}, for P 1 DNA encoding yields a DNA sequence of 1,048,576 characters. D 1 .

[0015] Step 4: DNA frameshift mutation: First, use formulas (5)-(7) to... D 1 Perform DNA frameshift mutations, sequentially according to x 2 s ∈ X 2 The value, s =1, 2, …, 512, randomly selected DNA sequences D 1 By taking two adjacent positions, shifting these two positions and the bases following them to the right by two positions, and then inserting the overflowing bases at the end into the selected positions, a DNA sequence of length 1048576 can be obtained. D 2 Secondly, using formulas (8)-(10) to... D 2 Perform DNA frameshift mutations, sequentially according to y 2 t ∈ Y 2 The value, t =1,2, …,512, randomly selected DNA sequences D 2 one position q ∈{1, 2, … 1048576}, will q By moving the bases at the specified position to the beginning of the DNA sequence, a DNA sequence of length 1048576 can be obtained. D 3 ; Figure 2 This is a schematic diagram of DNA frameshift mutations.

[0016] Step 5: DNA Decoding: Randomly select a DNA decoding rule. r h , h ∈{1, 2, … 8}, for D 3 DNA decoding is performed, and a two-dimensional matrix of size 512×512 is generated in a specific manner. P 2 =[ p 2 ij ].

[0017] Step 6: Image diffusion: Using formula (11) to diffuse the chaotic sequence Z 2 Convert into a two-dimensional matrix of size 512×512. W =[ w ij Reuse W And formula (12) P 2 Performing an XOR operation yields an encrypted image of size 512×512. P 3 =[ p 3 ij ],like Figure 4 As shown.

[0018] During the decryption process, the same chaotic sequence is used to decrypt the encrypted image, yielding the original image, such as... Figure 3 As shown. Bob's decryption process is the reverse of Alice's encryption process.

Claims

1. An image encryption method based on DNA frameshift mutations, characterized in that, The encryption process includes the following steps: Step 1: Generate chaotic sequences: The Logistic mapping is defined as: x n+1 = u × x n ×(1- x n )， （1） Among them, the iteration value x n ∈(0, 1), control parameters u ∈(3.57, 4]; First, let the original image be P 1 Its size is m × n Randomly select the control parameters for the Logistic mapping. u 1 and initial value x 0, iterate formula (1) 1000+ times m After discarding the first 1000 iterations, a length of [length missing] is obtained. m chaotic sequence X 1 ={ x 1 s Secondly, randomly select the control parameters for the Logistic mapping. u 2 and initial value y 0, iterate formula (1) 1000+ times n After discarding the first 1000 iterations, a length of [length missing] is obtained. n chaotic sequence Y 1 ={ y 1 t Finally, the control parameters for the Logistic mapping are randomly selected. u 3 and initial value z 0, iterate formula (1) 1000+ times m × n After discarding the first 1000 iterations, a length of [length missing] is obtained. m × n chaotic sequence Z 1 ={ z 1 k }; Step 2: Integerization of Chaotic Sequences: Computation, x 2 s = mod ( floor ( x 1 s ×10 16 ), 4× m × n -1)+1， s =1, 2, …, m ， （2） y 2 t = mod ( floor ( y 1 t ×10 16 ), 4× m × n )+1， t =1, 2, …, n ， （3） z 2 k = mod ( floor ( z 1 k ×10 16 ), 256)， k =1, 2, …, m × n ， （4） in, mod (·) is the modulo operation function. floor (·) is the floor function. x 1 s ∈ X 1 , y 1 t ∈ Y 1 , z 1 k ∈ Z 1 This generates three strings with lengths of... m , n and m × n The integer chaotic sequence is X 2 ={ x 2 s }、 Y 2 ={ y 2 t }and Z 2 ={ z 2 k }; Step 3: Image DNA Encoding: 8 DNA Encoding Rules: Rule 1 r 1 is: 00 is encoded as A 11 is encoded as T 01 is encoded as G 10 is encoded as C The second DNA coding rule r 2 is: 00 is encoded as A 11 is encoded as T 10 is encoded as G 01 is encoded as C The third DNA coding rule r 3 is: 01 is encoded as A 10 is encoded as T 00 is encoded as G 11 is encoded as C The fourth DNA coding rule r 4 is: 01 encoding is A 10 is encoded as T 11 is encoded as G 00 is encoded as C The fifth DNA coding rule r 5 is: 10 is encoded as A 01 is encoded as T 00 is encoded as G 11 is encoded as C The sixth DNA coding rule r 6 is: 10 is encoded as A 01 is encoded as T 11 is encoded as G 00 is encoded as C The 7th DNA coding rule r 7 is: 11 is encoded as A 00 is encoded as T 01 is encoded as G 10 is encoded as C The 8th DNA coding rule r 8 is: 11 is encoded as A 00 is encoded as T 10 is encoded as G 01 is encoded as C Randomly select a DNA coding rule r h , h ∈{1, 2, … 8}, for P 1 DNA encoding; P 1 Each pixel is 8 bits, which can be encoded into 4 bases, resulting in a 4×10^6 pixel. m × n DNA sequence D 1 ; Step 4: DNA frameshift mutation: First, use formulas (5)-(7) to... D 1 Perform DNA frameshift mutations, sequentially according to x 2 s ∈ X 2 The value, s =1, 2, …, m Randomly select DNA sequences D 1 middle e Adjacent positions, e If it is not 3 or a multiple of 3, put this e The positions and the bases following them are uniformly shifted backward. e Then, insert the overflowing base at the end into the selected position. D 2 ( x 2 s : x 2 s + e -1)= D 1 (4× m × n - e +1:4× m × n )， （5） D 2 ( x 2 s + e :4× m × n )= D 1 ( x 2 s :4× m × n - e )， （6） D 1 (1:4× m × n )= D 2 (1:4× m × n )， （7） We can obtain a length of 4× m × n DNA sequence D 2 Secondly, using formulas (8)-(10) to... D 2 Perform DNA frameshift mutations, sequentially according to y 2 t ∈ Y 2 The value, t =1, 2, …, n Randomly select DNA sequences D 2 one position q ∈{1, 2, …4× m × n },Will q The base at that position moves to the very beginning of the DNA sequence. D 3 (1)= D 2 ( y 2 t )， （8） D 3 (2: y 2 t )= D 2 (1: y 2 t -1)， （9） D 2 (1:4× m × n )= D 3 (1:4× m × n )， （10） We can obtain a length of 4× m × n DNA sequence D 3 ; Step 5: DNA Decoding: Randomly select a DNA decoding rule. r h , h ∈{1, 2, … 8}, for D 3 DNA decoding is performed, and a sample of size [size missing] is generated in a specific manner. m × n Two-dimensional matrix P 2 =[ p 2 ij ]; Step 6: Image diffusion: Using formula (11) to diffuse the image. Z 2 Convert to a size of m × n Two-dimensional matrix W =[ w ij ]; W = reshape ( Z 2 , m , n )， （11） in, reshape (·) is the matrix dimension reconstruction function; then calculate: p 3 ij = p 2 ij ⊕ w ij ， （12） in, i =1, 2, …, m ; j =1, 2, …, n ⊕ is the XOR operator. p 2 ij ∈ P 2 , z 3 ij ∈ Z 3 , to obtain a size of m × n Encrypted images P 3 =[ p 3 ij ].

Images