Image encryption method based on central law and three-dimensional bit plane

Through the image encryption method based on the central law and three-dimensional bit plane, combined with chaotic systems and biological processes, the traditional image encryption method is solved in terms of efficiency and security, and the efficient protection of image information and the improvement of security in network transmission is achieved. .

CN114362918BActive Publication Date: 2024-11-26CHINA UNIV OF MINING & TECH
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202210030022.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-01-12
Publication Date
2024-11-26
Estimated Expiration
2042-01-12

AI Technical Summary

Technical Problem

Traditional data encryption algorithms cannot effectively encrypt digital images, and the existing image encryption methods have insufficient efficiency and security, which is difficult to meet the network information transmission needs in the big data era.

Method used

Using image encryption method based on the central law and three-dimensional bit plane, combining SHA-256 hash value and external Parameters, simulate biological processes in nature, and achieve efficient encryption of images.

Benefits of technology

It improves the security and efficiency of image encryption, defines the three-dimensional bit plane and chaos mode, combines chaotic systems and biological processes, realizes effective protection of image information, and enhances the encryption security and efficiency in network transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114362918B_ABST
    Figure CN114362918B_ABST
Patent Text Reader

Abstract

A large number of images are generated and distributed in various fields every day. In order to protect image information from being stolen during network transmission, an image encryption method based on the genetic central dogma and three-dimensional bit plane is proposed. The present invention simulates the genetic central dogma and defines the three-dimensional bit plane. First, the original image is converted into an 8-bit binary image and converted into a standard three-dimensional matrix; second, the three-dimensional matrix is ​​permuted by rotating the bit plane and permuting between the bit planes; third, the chaotic three-dimensional matrix is ​​encoded into DNA code, and RNA mutations are introduced by imitating the genetic central dogma, and combined with chaos to achieve diffusion; finally, the encrypted image is obtained through RNA decoding operation. Experimental results and method analysis show that the method has strong security and good performance.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to an information encryption technology, in particular to an image encryption method. Background Art

[0002] In recent years, people have paid more and more attention to the security issues of networks and information systems. Images have become an important information carrier in people's daily lives. They can convey a large amount of information intuitively and vividly, and are widely used in communications, military and medical fields. However, due to the openness of the Internet, information is easily intercepted or leaked during network transmission. Data hiding and image encryption are common methods to keep images secure, but the former is subject to some limitations due to insufficient embedding capabilities. In contrast, image encryption can effectively protect images. Therefore, how to encrypt images effectively and securely becomes very important.

[0003] Because images have large data capacity and high redundancy correlation between pixels and data, traditional data encryption algorithms cannot encrypt digital images. In recent years, various encryption methods based on chaos have been proposed, such as chaos-based image encryption, compressed sensing-based image encryption, and genetic algorithm-based image encryption. With the advent of the big data era, network information transmission capabilities have also been improved, and the requirements for the efficiency and security of encryption methods have also been further improved.

[0004] In order to protect image information from being stolen and improve the security and efficiency of encryption during network transmission, an image encryption method based on the central law and three-dimensional bit plane is proposed. This method simulates the central law and defines a three-dimensional bit plane, which improves the security and efficiency of the encryption process. Summary of the invention

[0005] The purpose of the present invention is to protect image information from being stolen and to improve the security and efficiency of encryption during network transmission. An image encryption method based on the central law and three-dimensional bit plane is proposed.

[0006] Technical solution of the present invention: To achieve the above-mentioned invention object, the technical solution adopted is an image encryption method based on the central law and three-dimensional bit plane, and the encryption steps are described in detail as follows:

[0007] Step 1: Construct a three-dimensional matrix: Let the interaction image be I , the size is m × n ,Will I Each pixel value is converted into an 8-bit binary value, and the zero-filling operation can be I Build a size of d × d × d The three-dimensional matrix C= [ cij ], c ij = 0 or 1, where d is a positive integer, satisfying d 3 ≥8 month ,and d Minimum value;

[0008] Step 2: Generate a key: Use the SHA-256 secure hash algorithm to calculate I 256-bit hash value of K , divide it into blocks of 8 bits each, and we get K=k 1 , k 2 ,…, k 32 , and randomly select c 1 , c 2 , c 3 , c 4 , c 5 , c 6 As the external key input, the key generator shown in formulas (1)-(3) is used to calculate the initial value of the two-dimensional logistic-adjusted-sine map (2D-LASM) shown in formula (4) u 0 , v 0 and control parameters μ , and the initial value of the three-dimensional Sine chaotic system shown in formula (5) x 0 , y 0 , z 0 and control parameters a , b , c ; u 0 , v 0 , μ , x 0 , y 0 , z 0 , a , b , cis the key;

[0009] , (1)

[0010] Among them, ⊕ represents the exclusive OR operation;

[0011] , (2)

[0012] , (3)

[0013] in, courage (•) indicates modulo operation;

[0014] , (4)

[0015] in, μ ∈[0, 1] is the control parameter, u 0 , v 0 ∈(0, 1) is the initial value;

[0016] , (5)

[0017] in, a , b , c ∈[1, 4] is the control parameter, x 0 , y 0 , z 0 ∈[0, 1] is the initial value;

[0018] Step 3: Generate chaotic sequence: According to the initial value x 0 , y 0 , z 0 and control parameters a , b , c The three-dimensional Sine chaotic system shown in iterative formula (5) is 1000+ d times, discarding the first 1000 iteration values, and generating 3 values ​​of the same length. d Chaotic sequence X , Y and Z ; According to the initial value u 0 , v 0 and control parameters μ , the 2D-LASM1000+ shown in iterative formula (4)d 3 / 2 times, discarding the first 1000 iteration values, and generating 2 values ​​with the same length d 3 / 2 chaotic sequence U and V ;

[0019] Step 4: 3D bit plane scrambling: using X , Y and Z , respectively scramble C A three-dimensional bit plane set, including X Bitplane Set P x ={ p x ( i )}, Y Bitplane Set P y ={ p y ( i )} and Z plane set P z ={ p z ( i )}, and finally we can get the three-dimensional scrambled matrix P 6 ; The specific operation is: use X And formula (6)-(9), rotation and scrambling P x ={ p x ( i )},

[0020] [ X 1 , S 1 ] =black ( x ( i )), i= 1, 2, … , d , (6)

[0021] T 1 =courage ( floor ( x ( i )×10 16 ), 4)×90, (7)

[0022] in, black (•) is the ascending sort function, floor(•) is the floor function, x ( i )∈ X , X 1 is the new sequence after sorting, S 1 yes X 1 The index value of

[0023] P 1 ( i , :, :) =imrotate ( C ( i , :, :), t 1 ( i )), i= 1, 2, … , d , (8)

[0024] in, theimrotate (•) is the rotation function, C ( i , :, :)for C No. i indivual X bit plane, t 1 ( i )∈ T 1 is the rotation angle value of the bit plane, t 1 ( i ) can be 0°, 90°, 180° or 270°, P 1 ( i , :, :) is a three-dimensional matrix P 1 No. i indivual X bit plane;

[0025] P 2 ( i , :, :) =P 1 ( s 1 ( i ), :, :), i= 1, 2, … , d , (9)

[0026] in, s 1 (i )∈ S 1 , P 2 ( i , :, :) is a three-dimensional matrix P 2 No. i indivual X bit plane;

[0027] use Y and formulas (10)-(13), rotation and scrambling P y ={ p y ( i )},

[0028] [ Y 1 , S 2 ] =black ( y ( i )), i= 1, 2, … , d , (10)

[0029] T 2 =courage ( floor ( y ( i )×10 16 ), 4)×90, (11)

[0030] in, y ( i )∈ Y , Y 1 is the new sequence after sorting, S 2 yes Y 1 The index value of

[0031] P 3 (:, i , :) =imrotate ( P 2 (:, i , :), t 2 ( i )), i= 1, 2, … , d , (12)

[0032] in, P 2 (:, i , :) is a three-dimensional matrix P 2 No. i indivual Y bit plane, t 2 ( i )∈ T 2 , P 3 (:, i , :) is a three-dimensional matrix P 3 No. i indivual Y bit plane;

[0033] P 4 (:, i , :) =P 3 (:, s 2 ( i ), :), i= 1, 2, … , d , (13)

[0034] in, s 2 ( i )∈ S 2 , P 4 (:, i , :) is a three-dimensional matrix P 4 No. i indivual Y bit plane;

[0035] use Z and formulas (14)-(17), rotation and scrambling P z ={ p z ( i )},

[0036] [ Z 1 , S 3 ] =black ( z ( i )), i= 1, 2, … ,d , (14)

[0037] T 3 =courage ( floor ( z ( i )×10 16 ), 4)×90, (15)

[0038] in, z ( i )∈ Z , Z 1 is the new sequence after sorting, S 3 yes Z 1 The index value of

[0039] P 5 (:, :, i ) =imrotate ( P 4 (:, :, i ), t 3 ( i )), i= 1, 2, … , d , (16)

[0040] in, P 4 (:, :, i ) is a three-dimensional matrix P 4 No. i indivual Z bit plane, t 3 ( i )∈ T 3 , P 5 (:, :, i ) is a three-dimensional matrix P 5 No. i indivual Z bit plane;

[0041] P 6 (:, :, i ) =P 5 (:, :, s 3 (i )), i= 1, 2, … , d , (17)

[0042] in, s 3 ( i )∈ S 3 , P 6 (:, :, i ) is a three-dimensional matrix P 6 No. i indivual Z bit plane;

[0043] Step 5: DNA encoding: The DNA encoding rules are:

[0044]

[0045] calculate:

[0046] l i =courage ( sum ( P 6 ( i , :, :), 8), i= 1, 2, … , d , (18)

[0047] in, P 6 ( i , :, :)) is a three-dimensional matrix P 6 No. i indivual X bit plane, sum (•) is the summation function, according to the DNA coding rule l i Encoding rules, P 6 No. i indivual X The bit plane is encoded, and a size of d / 2× d × d Three-dimensional DNA encoding matrix P 7 ;

[0048] Step 6: DNA transcription: The rules of DNA transcription are:

[0049]

[0050] According to the DNA transcription rules, P 7 After transcription, we can get a size of d / 2× d × d Three-dimensional RNA matrix P 8 ;

[0051] Step 7: RNA mutation: The RNA mutation rules are:

[0052]

[0053] Using formula (19) U Integerization,

[0054] U 1 =floor ( courage ( U ×10 16 , 4), (19)

[0055] in, U 1 The generated integer chaotic sequence takes the value of 0, 1, 2 or 3, corresponding to the four modes of RNA mutation. According to a certain rule, U 1 Convert to a size of d / 2× d × d The matrix U 2 ;use U 2 And formula (20), for P 8 RNA mutation occurs,

[0056] P 9 ( w 1 , w 2 , w 3 ) =Mutation ( P 8 ( w 1 , w 2 , w 3 ), U 2 ( w1 , w 2 , w 3 )), (20)

[0057] in, w 1 = 1, 2, … , d / 2, w 2 = 1, 2, … , d , w 3 = 1, 2, … , d , Mutation ( x , y ) indicates base x According to the RNA mutation rules y mutation mode, we can get a size of d / 2× d × d RNA mutation matrix P 9 ;

[0058] Step 8: RNA translation: The RNA translation rules are:

[0059]

[0060] According to RNA translation rules, P 9 After translation, we can get a size of d / 2× d × d The three-dimensional matrix P 10 ;

[0061] Step 9: RNA calculation: The RNA encoding rule is:

[0062]

[0063] The RNA XOR rule is:

[0064]

[0065] Select V Before d 2 / 8 elements constitute a chaotic subsequence V 1, using formula (21) V 1 Integerization,

[0066] V 2 =floor ( courage ( V 1 ×10 16 , 256), (21)

[0067] in, V 2 is the generated integer chaotic sequence; according to the first RNA encoding rule V 2 Encoding can get a size of d 2 / 8×4 two-dimensional RNA matrix V 3 According to a certain rule, V 3 Convert to a size of d / 2× d The matrix V 4 ; Perform the diffusion operation as shown in formula (22) to obtain a d / 2× d × d The diffusion matrix P 11 ;

[0068] , (twenty two)

[0069] Among them, ☉ represents RNA XOR operation, P 10 ( j ,:,:) is a three-dimensional matrix P 10 No. j indivual X bit plane, P 11 ( j ,:, :) is a three-dimensional matrix P 11 No. j indivual X bit plane;

[0070] Step 10: RNA decoding: The RNA decoding rules are:

[0071]

[0072] calculate:

[0073] r i =courage ( sum ( P 11 (:, :, i ), 8), i= 1, 2, … , d , (twenty three)

[0074] in, P 11 (:, :, i ) is a three-dimensional matrix P 11 No. i indivual Z Bit plane; according to the RNA decoding rule r i Decoding rules for P 11 No. i indivual Z The bit plane is decoded to obtain a size of d × d × d The decoding matrix C p ; Remove the zero elements added in step 1 in the matrix and convert the 8-bit binary value in the matrix into a decimal pixel value, and you can get a size of m × n Encrypted image of E .

[0075] In the decryption process, the encrypted image is decrypted using the same chaotic sequence to restore the original image. The decryption process is the inverse process of the encryption process.

[0076] Beneficial effects: In order to protect image information from being stolen and improve the security and efficiency of encryption during network transmission, an image encryption method based on the central law and three-dimensional bit plane is proposed. The main contributions are as follows: (1) The three-dimensional bit plane is defined, and the three-dimensional scrambling method is designed, which can scramble multiple bit planes synchronously; (2) The initial value and control parameters of the chaotic system are jointly generated by the SHA-256 hash value of the plaintext image and external parameters; (3) The central law is simulated, including DNA encoding, transcription, translation and amino acid synthesis, so that image encryption is closely integrated with biological genetic processes; (4) RNA mutations are introduced in the encryption process to simulate the mutation process in nature. The randomness of the mutation mode and position further improves the security of the encryption method. The RNA operation is combined with the chaotically generated RNA matrix to achieve further diffusion; (5) The experimental results and method analysis verify the feasibility and security of the proposed method. BRIEF DESCRIPTION OF THE DRAWINGS

[0077] Figure 1 : Encryption flow chart;

[0078] Figure 2 : original image;

[0079] Figure 3 : Encrypted image. DETAILED DESCRIPTION

[0080] The implementation process of the present invention is further described in detail below with reference to specific drawings and examples.

[0081] Figure 1 It is the encryption flow chart of this method.

[0082] The programming software used is Matlab R2016a, Figure 2 The Lena grayscale image with a size of 512×512 is shown as the experimental object.

[0083] Step 1: Construct a three-dimensional matrix: Input a 512×512 Lena grayscale image as the plaintext image I ,Will I Each pixel value is converted into an 8-bit binary value, and the zero-filling operation can be I Construct a three-dimensional matrix of size 128×128×128 C= [ c ij ], c ij =0 or 1.

[0084] Step 2: Generate a key: Use the SHA-256 secure hash algorithm to calculate I 256-bit hash value of K , divide it into blocks of 8 bits each, and we get K=k 1 , k 2 ,…, k 32 , select c 1 =0.6723, c 2 =0.1839, c 3 =0.2343, c 4 =0.0928, c 5 =0.5623, c 6 =0.2613 is used as the external key input, and the key generator is used to calculate the initial value of 2D-LASMu 0 , v 0 and control parameters μ , and the initial value of the three-dimensional Sine chaotic system x 0 , y 0 , z 0 and control parameters a , b , c .

[0085] Step 3: Generate chaotic sequence: According to the initial value x 0 , y 0 , z 0 and control parameters a , b , c Iterating the three-dimensional Sine chaotic system 1128 times and discarding the first 1000 iteration values ​​can generate three chaotic sequences with a length of 128. X , Y and Z ; According to the initial value u 0 , v 0 and control parameters μ , iterate 2D-LASM 1049576 times, discard the first 1000 iteration values, and generate 2 chaotic sequences with a length of 1048576 U and V .

[0086] Step 4: 3D bit plane scrambling: using X , Y and Z , respectively scramble C A three-dimensional bit plane set, including X Bitplane Set P x ={ p x ( i )}, Y Bitplane Set P y ={ p y ( i )} and Z plane set P z ={ p z ( i )}, and finally we can get the three-dimensional scrambled matrixP 6 .

[0087] Step 5: DNA encoding: Using formula (18), according to the DNA encoding rule l i Encoding rules, P 6 No. i indivual X The bit plane is encoded to obtain a three-dimensional DNA encoding matrix of size 64×128×128 P 7 .

[0088] Step 6: DNA transcription: According to the DNA transcription rules, P 7 After transcription, a three-dimensional RNA matrix of size 64×128×128 can be obtained. P 8 .

[0089] Step 7: RNA mutation: U 1 for U The integer chaotic sequence takes the value of 0, 1, 2 or 3, corresponding to the four modes of RNA mutation; according to a certain rule, U 1 Convert to a matrix of size 64×128×128 U 2 ,use U 2 right P 8 When RNA mutation occurs, an RNA mutation matrix of size 64×128×128 can be obtained. P 9 .

[0090] Step 8: RNA translation: According to the RNA translation rules, P 9 After translation, we get a three-dimensional matrix of size 64×128×128 P 10 .

[0091] Step 9: RNA calculation: selection V The first 2048 elements of constitute a chaotic subsequence V 1 , V 2 for V 1 According to the first RNA coding rule, V 2After encoding, a two-dimensional RNA matrix of size 2048×4 can be obtained. V 3 According to a certain rule, V 3 Convert to a matrix of size 64×128 V 4 ;use V 4 right P 10 Performing a diffusion operation, we can get a diffusion matrix of size 64×128×128 P 11 .

[0092] Step 10: RNA decoding: Using formula (23), according to the RNA decoding rule r i Decoding rules for P 11 No. i indivual Z The bit plane is decoded to obtain a decoding matrix of size 128×128×128 C p ; Remove the zero elements added in step 1 in the matrix and convert the 8-bit binary values ​​in the matrix into decimal pixel values ​​to obtain an encrypted image of size 512×512 E ,like Figure 3 shown.

[0093] During the decryption process, the same chaotic sequence is used to encrypt the image. E The original image can be restored by performing a decryption operation. The decryption process is the reverse process of the encryption process.

Claims

1. An image encryption method based on the central law and three-dimensional bit plane, characterized in that: The steps include: Step 1: Construct a three-dimensional matrix: Let the interaction image be I , the size is m × n ,Will I Each pixel value is converted into an 8-bit binary value, and the zero-filling operation can be I Build a size of d × d × d The three-dimensional matrix C= [ c ij ], c ij = 0 or 1, where d is a positive integer, satisfying d 3 ≥8 mn ,and d Minimum value; Step 2: Generate a key: Use the SHA-256 secure hash algorithm to calculate I 256-bit hash value of K , divide it into blocks of 8 bits each, and we get K=k 1, k 2,…, k 32 , and randomly select c 1, c 2, c 3, c 4, c 5, c 6 is used as the external key input, and the key generator shown in formulas (1)-(3) is used to calculate the initial value of the two-dimensional logistic-adjusted-sine map (2D-LASM) shown in formula (4) u 0, v 0 and control parameters μ , and the initial value of the three-dimensional Sine chaotic system shown in formula (5) x 0, y 0, z 0 and control parameters a , b , c ; u 0, v 0, μ , x 0, y 0, z 0, a , b , c is the key; , (1) Among them, ⊕ represents the exclusive OR operation; , (2) , (3) in, mod (•) indicates modulo operation; , (4) in, μ ∈[0, 1] is the control parameter, u 0, v 0∈(0, 1) is the initial value; , (5) in, a , b , c ∈[1, 4] is the control parameter, x 0, y 0, z 0∈[0, 1] is the initial value; Step 3: Generate chaotic sequence: According to the initial value x 0, y 0, z 0 and control parameters a , b , c The three-dimensional Sine chaotic system shown in iterative formula (5) is 1000+ d times, discarding the first 1000 iteration values, and generating 3 values ​​of the same length. d Chaotic sequence X , Y and Z ; According to the initial value u 0, v 0 and control parameters μ , the 2D-LASM1000+ shown in iterative formula (4) d 3 / 2 times, discarding the first 1000 iteration values, and generating 2 values ​​with the same length d 3 / 2 chaotic sequence U and V ; Step 4: 3D bit plane scrambling: using X , Y and Z , respectively shuffle C A three-dimensional bit plane set, including X Bitplane Set P x ={ p x ( i )}, Y Bitplane Set P y ={ p y ( i )} and Z plane set P z ={ p z ( i )}, and finally we can get the three-dimensional scrambled matrix P 6 ; The specific operation is: use X And formula (6)-(9), rotation and scrambling P x ={ p x ( i )}, [ X 1 , S 1] =sort ( x ( i )), i= 1, 2, … , d , (6) T 1 =mod ( floor ( x ( i )×10 16 ), 4)×90, (7) in, sort (•) is the ascending sort function, floor (•) is the floor function, x ( i )∈ X , X 1 is the new sequence after sorting, S 1 Yes X 1 The index value of P 1 ( i , :, :) =imrotate ( C ( i , :, :), t 1( i )), i= 1, 2, … , d , (8) in, imrotatet (•) is the rotation function, C ( i , :, :)for C No. i indivual X bit plane, t 1( i )∈ T 1 is the rotation angle value of the bit plane, t 1( i ) can be 0°, 90°, 180° or 270°, P 1 ( i , :, :) is a three-dimensional matrix P 1 No. i indivual X bit plane; P 2 ( i , :, :) =P 1 ( s 1( i ), :, :), i= 1, 2, … , d , (9) in, s 1( i )∈ S 1, P 2 ( i , :, :) is a three-dimensional matrix P 2 No. i indivual X bit plane; use Y and formulas (10)-(13), rotation and scrambling P y ={ p y ( i )}, [ Y 1 , S 2] =sort ( y ( i )), i= 1, 2, … , d , (10) T 2 =mod ( floor ( y ( i )×10 16 ), 4)×90, (11) in, y ( i )∈ Y , Y 1 is the new sequence after sorting, S 2 Yes Y 1 The index value of P 3 (:, i , :) =imrotate ( P 2 (:, i , :), t 2( i )), i= 1, 2, … , d , (12) in, P 2 (:, i , :) is a three-dimensional matrix P 2 No. i indivual Y bit plane, t 2( i )∈ T 2, P 3 (:, i , :) is a three-dimensional matrix P 3 No. i indivual Y bit plane; P 4 (:, i , :) =P 3 (:, s 2( i ), :), i= 1, 2, … , d , (13) in, s 2( i )∈ S 2, P 4 (:, i , :) is a three-dimensional matrix P 4 No. i indivual Y bit plane; use Z and formulas (14)-(17), rotation and scrambling P z ={ p z ( i )}, [ Z 1 , S 3] =sort ( z ( i )), i= 1, 2, … , d , (14) T 3 =mod ( floor ( z ( i )×10 16 ), 4)×90, (15) in, z ( i )∈ Z , Z 1 is the new sequence after sorting, S 3 Yes Z 1 The index value of P 5 (:, :, i ) =imrotate ( P 4 (:, :, i ), t 3( i )), i= 1, 2, … , d , (16) in, P 4 (:, :, i ) is a three-dimensional matrix P 4 No. i indivual Z bit plane, t 3( i )∈ T 3. P 5 (:, :, i ) is a three-dimensional matrix P 5 No. i indivual Z bit plane; P 6 (:, :, i ) =P 5 (:, :, s 3( i )), i= 1, 2, … , d , (17) in, s 3( i )∈ S 3. P 6 (:, :, i ) is a three-dimensional matrix P 6 No. i indivual Z bit plane; Step 5: DNA encoding: The DNA encoding rules are: calculate: l i =mod ( sum ( P 6 ( i , :, :), 8), i= 1, 2, … , d , (18) in, P 6 ( i , :, :)) is a three-dimensional matrix P 6 No. i indivual X bit plane, sum (•) is the summation function, according to the DNA coding rule l i Encoding rules, P 6 No. i indivual X The bit plane is encoded, and a size of d / 2× d × d Three-dimensional DNA encoding matrix P 7 ; Step 6: DNA transcription: The DNA transcription rules are: According to the DNA transcription rules, P 7 After transcription, we can get a size of d / 2× d × d Three-dimensional RNA matrix P 8 ; Step 7: RNA mutation: The RNA mutation rules are: Using formula (19) U Integerization, U 1 =floor ( mod ( U ×10 16 , 4), (19) in, U 1 The generated integer chaotic sequence takes the value of 0, 1, 2 or 3, corresponding to the four modes of RNA mutation. According to a certain rule, U 1 Convert to a size of d / 2× d × d The matrix U 2 ;use U 2 And formula (20), for P 8 RNA mutation occurs, P 9 ( w 1, w 2, w 3) =Mutation ( P 8 ( w 1, w 2, w 3), U 2 ( w 1, w 2, w 3)), (20) in, w 1 = 1, 2, … , d / 2, w 2 = 1, 2, … , d , w 3 = 1, 2, … , d , Mutation ( x , y ) indicates base x According to the RNA mutation rules y mutation mode, we can get a size of d / 2× d × d RNA mutation matrix P 9 ; Step 8: RNA translation: The RNA translation rules are: According to RNA translation rules, P 9 After translation, we can get a size of d / 2× d × d The three-dimensional matrix P 10 ; Step 9: RNA calculation: The RNA encoding rule is: The RNA XOR rule is: Select V Before d 2 / 8 elements constitute a chaotic subsequence V 1 , using formula (21) V 1 Integerization, V 2 =floor ( mod ( V 1 ×10 16 , 256), (21) in, V 2 is the generated integer chaotic sequence; according to the first RNA encoding rule V 2 Encoding can get a size of d 2 / 8×4 two-dimensional RNA matrix V 3 According to a certain rule, V 3 Convert to a size of d / 2× d The matrix V 4 ; Perform the diffusion operation as shown in formula (22) to obtain a d / 2× d × d The diffusion matrix P 11 ; , (22) Among them, ☉ represents RNA XOR operation, P 10 ( j , :, :) is a three-dimensional matrix P 10 No. j indivual X bit plane, P 11 ( j , :, :) is a three-dimensional matrix P 11 No. j indivual X bit plane; Step 10: RNA decoding: The RNA decoding rules are: calculate: r i =mod ( sum ( P 11 (:, :, i ), 8), i= 1, 2, … , d , (23) in, P 11 (:, :, i ) is a three-dimensional matrix P 11 No. i indivual Z Bit plane; according to the RNA decoding rule r i Decoding rules for P 11 No. i indivual Z The bit plane is decoded to obtain a size of d × d × d The decoding matrix C p ; Remove the zero elements added in step 1 in the matrix and convert the 8-bit binary value in the matrix into a decimal pixel value, and you can get a size of m × n Encrypted image of E .

2. The method according to claim 1, characterized in that: In step 4, the three-dimensional bit plane includes X bit plane, Y Bit planes and Z bit plane; in, X The bit plane is composed of 0 / 1 in the three-dimensional matrix. X The bit planes consist of elements with equal coordinate values; Y The bit plane is composed of 0 / 1 in the three-dimensional matrix. Y The bit planes consist of elements with equal coordinate values; Z The bit plane is composed of 0 / 1 in the three-dimensional matrix. Z Elements with equal coordinate values ​​constitute a bit plane.

Citation Information

Patent Citations

  • Digital image encryption algorithm based on bit plane and high-dimensional chaotic system

    CN107392970A

  • Multi-chaotic mapping and DNA coding-integrated image encryption method and device

    CN107610037A

  • Multi-image encryption method based on bit plane and chaos

    CN111080506A

  • Image encryption method based on block scrambling and state conversion

    CN112422268A

  • Image encryption method based on RNA and pixel depth

    CN113612899A