Method for sharing secret image using DNA security coding

Abstract

The DNA security coding secret image sharing method relates to the image encryption technical field and solves the multimedia data security problem under the existing network environment.The DNA security coding secret image sharing method generates the image encryption key by a 3D chaotic system with good chaotic state, splits the pixels in an image into two images, and then carries out the shuffling process, changes the pixel value at the same time of shuffling, achieves the diffusion effect, uses the chaotic sequence to randomly select the DNA coding and decoding mode, uses the DNA coding of the chaotic sequence and the coding sequence of the image to carry out the DNA addition operation, uses the lightweight XOR method to diffuse the image again, further improves the ability of the ciphertext image to resist various security attacks, and combines the use of the image secret sharing algorithm to generate n shadow images from the ciphertext, improves the security of image data storage and transmission, and the like.

Description

DNA secure encoding secret image sharing method Technical Field

[0001] This invention relates to the field of image encryption technology, specifically to a method for sharing secret images using DNA-secure encoding. Background Technology

[0002] With the continuous development of internet technology, data security on the internet is facing unprecedented challenges. Data types in the internet environment are complex, and image data is one of the most intuitive data types, thus requiring higher security during transmission. Encrypting images can effectively prevent data leakage and tampering. Image data is widely used in various fields such as medicine, military, science and technology, and education, and has attracted the attention of many scholars at home and abroad. Various effective image encryption technologies have been proposed to address the different needs of image encryption in different fields. Basic image encryption algorithms can use scrambling methods to change pixel positions, diffusion methods to change pixel values, and combine other related image encryption techniques to ensure the security of plaintext images. However, the encrypted images need to be transmitted and stored, which may be subject to various attacks that could lead to file corruption or destruction during transmission. There is also the risk of losing complete files due to storage server failures. Current image encryption methods only hide plaintext information and have not yet adequately addressed the situations described above. Summary of the Invention

[0003] This invention provides a method for sharing secret images using DNA-secure encoding to address multimedia data security issues in existing network environments.

[0004] A DNA-secure encoded secret image sharing method, implemented by an image generator, participants, and an image verifier, is achieved through the following steps:

[0005] Step 1: The shared image generator encrypts the original image to obtain the original ciphertext image;

[0006] Step 2: Generate n shadow images from the original encrypted image and transmit them to... Each participant shares the storage. When a participant sends the shadow image to the shared image verification party, the original ciphertext image is recovered, and then the original ciphertext image is decrypted using a decryption method to obtain the initial image.

[0007] The specific process of generating n shadow images is as follows:

[0008] Step 2: Convert each pixel value in the three color channels of the original encrypted image obtained in Step 1 into an eight-bit binary number, and then convert each... The pixel values ​​of the three corresponding color channels are combined to obtain A one-dimensional binary sequence, ultimately yielding a binary matrix ;

[0009] Step 22: User input The values ​​of the two control parameters are used to obtain the control parameters. ,in, It is a positive integer, and ;

[0010] Step 23: When the binary matrix obtained in Step 21... Corresponding position When the element value is equal to 1, use the control parameter Generate a short random sequence Using step two Control parameters Obtain a random control sequence ;

[0011] Step Two Four: Generation indivual The zero matrix, and the random control sequence described in steps two and three. Set the elements in the zero matrix to 1, and use Using the element value as an index, the corresponding Position in a zero matrix Set the value to Finally obtained The value of each element is Bit binary matrix;

[0012] Step 25, regarding the above indivual Bit binary Each in the matrix The binary elements are truncated, with the first eight bits used as elements in the red shared image, the middle eight bits as elements in the green shared image, and the last eight bits as elements in the blue shared image, ultimately generating... A red shared matrix, A green sharing matrix and A blue shared matrix;

[0013] Step 26: Obtain the results from Step 25 A red shared matrix, A green sharing matrix and Convert the elements in the blue shared matrix to decimal to generate... A red shared image, A green shared image and Blue shared image

[0014] Step 27: The steps described in Step 26 A red shared image, A green shared image and The blue shared images are combined to generate the final product. A shadow image.

[0015] The beneficial effects of this invention are as follows: The image secret sharing method based on 3D chaotic system and DNA encoding proposed in this invention uses a 3D chaotic system with a good chaotic state to generate the image encryption key. It splits the pixels in an image into two images and then scrambles them, changing the pixel values ​​during scrambling, achieving a diffusion effect. A chaotic sequence is used to randomly select the DNA encoding and decoding method, and DNA addition is performed between the DNA encoding of the chaotic sequence and the image's encoding sequence. A lightweight XOR method is then used to further diffuse the image, further improving the encrypted image's resistance to various security attacks. Furthermore, the image secret sharing algorithm generates n shadow images from the encrypted image, enhancing the security of image data storage and transmission. Attached Figure Description

[0016] Figure 1 is a flowchart of the encryption process in the DNA secure encoding secret image sharing method of the present invention;

[0017] Figure 2 is a flowchart of the decryption process in the DNA secure encoding secret image sharing method of the present invention;

[0018] Figure 3 is a diagram of the DNA encoding algorithm used in this invention; wherein, 3A is a diagram of DNA encoding rules; and 3B is a diagram of DNA addition rules.

[0019] Figure 4 shows the effect of encryption and decryption using the DNA secure encoding secret image sharing method described in this invention: where 4A is the original image of the "puppy"; 4B is the encrypted image of the "puppy"; 4C is the final decryption result of the "puppy"; and 4D-4H are the shadow images generated from the encrypted image of the "puppy".

[0020] Figure 5 is a flowchart of the image secret sharing method described in this invention. Detailed Implementation

[0021] Specific Implementation Method 1: Referring to Figures 1 to 5, this implementation method for DNA-securely encoded secret image sharing involves the following steps:

[0022] Step 1: Select size as The color image is used as the original image Image;

[0023] Step 2: Divide the original image Image described in Step 1 into three color components, namely the red component. Green components Blue component ;

[0024] Step 3: Transfer the red component described in Step 2 Green components Blue component Converted into one-dimensional image red sequences respectively One-dimensional image green sequence One-dimensional image blue sequence ;

[0025] Step 4: From the one-dimensional image red sequence in Step 3 Split the high four bits and low four bits of each element in the red sequence of a one-dimensional image to generate a one-dimensional red high-bit sequence. and ;

[0026] Step 5: Calculate the one-dimensional red high-order sequence obtained in Step 4. Turn to Red high-order matrix , Turn to Red low-order matrix ;

[0027] Step Six: Obtain the red high-order matrix from Step Five. and red low-order matrix The two scrambled matrices, one for each of the red high-order positions, are obtained. and the red low-position random matrix ;

[0028] Step 7: Randomize the red high-position matrix described in Step 6. and the red low-position random matrix Converted into two one-dimensional sequences The sequence is processed according to the method shown in (Formula 1). Perform sequential value retrieval on the sequence By reversing the order of values, the two one-dimensional sequences are combined into one. Red component scrambling matrix ;

[0029] (Formula 1)

[0030] Where, the x-axis y-axis .

[0031] Step 8: Calculate the hash value associated with the plaintext using a hash function and process it as the initial value for the chaotic key generation system. and ;

[0032] Step 9: Use the initial values ​​obtained in Step 8 and The chaotic system is iteratively calculated, and the following are generated respectively. Three initial chaotic sequences;

[0033] Step 10: Truncate the initial chaotic sequence generated in Step 9 to a length of... The sequence is truncated, and the truncated length is [length]. The sequence is denoted as the key chaotic sequence. ;

[0034] Step 11: Extract the three key chaotic sequences from Step 10. In Extracted to a length of The sequence to be sorted ,Will Cut length is The sequence to be sorted and length is The sequence to be sorted ,Will Cut length is The sequence to be sorted ;

[0035] Step 12: Sort the four sequences to be sorted generated in Step 11. Sort the data in ascending order to obtain four sorted sequences. Compare with the original sequence to be sorted. The position in the middle generates four index sequences. ;

[0036] Step 13: Green sequence of the one-dimensional image from Step 3 Extract the high four bits and low four bits of each element in the green sequence of a one-dimensional image to generate a one-dimensional green high-bit sequence. and ;

[0037] Step Fourteen: Calculate the one-dimensional green high-order sequence generated in Step Thirteen. and Put in a Green scramble matrix In the process, the index sequence generated in step twelve is used. To select elements from the sequence and insert them into the green scramble matrix The x and y coordinates of the midpoint;

[0038] Step 15: The green scrambling matrix obtained in Step 14... Horizontally adjacent elements are merged into one. Green component scrambling matrix ;

[0039] Step 16: Blue the one-dimensional image sequence from Step 3. Extract the high four bits and low four bits of each element in the blue sequence of a one-dimensional image to generate a one-dimensional blue high-bit sequence. and ;

[0040] Step 17: Calculate the one-dimensional blue high-order sequence generated in Step 16. and Put in a Blue scrambled matrix In the process, the index sequence generated in step twelve is used. To select elements from the sequence and insert them into the blue scramble matrix The x and y coordinates of the midpoint;

[0041] Step 18: The blue scrambling matrix obtained in Step 17... Vertically adjacent elements are merged into one. Blue component scrambling matrix ;

[0042] Step 19: Map the three chaotic sequences X1, Y1, and Z1 extracted in Step 11 to element values ​​in... Three diffusing chaotic sequences between ;

[0043] Step 20: Develop the diffused chaotic sequence generated in Step 19. and Mapped to element value in The two one-dimensional rule selection sequences between and ;

[0044] Step 21: Using the sequence generated in Step 20 Select a DNA coding rule from the DNA coding rule table and scramble the red component matrix generated in step seven. Step 15 generates the green component scrambling matrix. And the scrambling matrix of the blue component generated in step eighteen DNA encoding yields three color component encoding matrices. and ;

[0045] Step 22: Using the sequence generated in step 20 Select a DNA coding rule from the DNA coding rule table and apply it to the chaotic sequence generated in step nineteen. DNA encoding to obtain coding sequences ;

[0046] Step 23: Encode the three color components from Step 21 into a single encoding matrix. and The sequence is converted into three one-dimensional color component coding sequences, respectively according to the DNA addition rule table and the coding sequences generated in step twenty-two. DNA addition yields three one-dimensional addition coding sequences. and ;

[0047] Step 24: Select the sequence using the one-dimensional rule generated in Step 20. Select the DNA decoding rule and apply it to the three additive coding sequences after step twenty-three. and Decoding yields three one-dimensional color component decoding sequences. and ;

[0048] Step 25: Decode the red component sequence generated in Step 24. Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step nineteen Divided into four equal parts, four short chaotic sequences were obtained. and Using the method shown in (Formula 2), a diffusion operation is performed, and the four resulting sequences are combined to obtain the XORed red component diffusion sequence. Then the sequence Turn to Red channel encrypted image ;

[0049] (Formula 2)

[0050] Among them, parameters .

[0051] Step 26: Decode the green component sequence generated in Step 24. Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step nineteen Divided into four equal parts, four short chaotic sequences were obtained. and Using the method shown in Formula 3, a diffusion operation is performed, and the four resulting sequences are combined to obtain the XORed green component diffusion sequence. Then the sequence Turn to Green channel encrypted image ;

[0052] (Formula 3)

[0053] Step 27: Decode the blue component sequence generated in step 24. Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step nineteen Divided into four equal parts, four short chaotic sequences were obtained. and Using the method shown in Formula 4, a diffusion operation is performed, and the four resulting sequences are combined to obtain the XORed blue component diffusion sequence. Then the sequence Turn to Blue channel encrypted image ;

[0054] (Formula 4)

[0055] Step 28: Combine the three color channel encrypted images obtained in steps 25, 26, and 27. and The original encrypted image is obtained. ;

[0056] Step 29: Obtain the original encrypted image from Step 28. Each pixel value in the three color channels is converted into an eight-bit binary number, and then each... The pixel values ​​of the three color channels corresponding to a given location can be combined to obtain a... A one-dimensional binary sequence can ultimately yield a... binary matrix ;

[0057] Step 30: User input The values ​​of the two control parameters are used to obtain the control parameters. ,in It is a positive integer, and ;

[0058] Step 31: When the binary matrix obtained in step 29... Corresponding position When the element value is equal to 1, use the control parameter Generate a short random sequence Using step thirty Control parameters A random control sequence is obtained. ;

[0059] Step 32, Generate indivual The zero matrix Each element is 24 bits;

[0060] Step 33: Use the random control sequence generated in step 31 Set the elements of the zero matrix generated in step 32 to 1, and then use... Using the element value as an index, the corresponding Position in a zero matrix Set the value to Finally, we got The value of each element is Bit binary matrix , where parameters The x-coordinate of the pixel is ,parameter The ordinate of the pixel is ;

[0061] Step 34: For the data generated in step 33... indivual Bit binary Each in the matrix The binary elements are truncated, with the first eight bits used as elements in the red shared image, the middle eight bits as elements in the green shared image, and the last eight bits as elements in the blue shared image, generating... A red shared matrix , Green Sharing Matrix and A blue shared matrix ;

[0062] Step 35: The product generated in step 34... A red shared matrix A green sharing matrix and Convert the elements in the blue shared matrix to decimal to generate... Red shared image , Green shared image and Blue shared image ,

[0063] Step 36: The product generated in step 35... A red shared image, A green shared image and The blue shared images are combined to generate the final product. A shadow image ;

[0064] Step 37: The product generated in step 36... A shadow image Distribute to Each participant shares storage, when one of them... When one or more participants send their shadow images to the shared image verifier, they can access the original encrypted image. The image is then recovered by performing the recovery process and then using decryption methods to decrypt the original ciphertext image. .

[0065] Specific Implementation Method Two: This implementation method is illustrated in conjunction with Figures 1 to 5. This implementation method is an embodiment of the DNA-securely encoded secret image sharing method described in Specific Implementation Method One. The method is implemented through the following steps:

[0066] Step 1: Select size as The color image of a puppy is used as the original image Image in this embodiment. As shown in Figure 4A;

[0067] Step 2: Divide the original image Image from Step 1 into three color components using Equation (1), namely the red component. Green components Blue component ;

[0068]

[0069] in To extract the red channel of the original image, To extract the green channel from the original image, To extract the blue channel from the original image.

[0070] Step 3: Transfer the red component described in Step 2 Green components Blue component Using equation (2), they are respectively converted into one-dimensional image red sequences. One-dimensional image green sequence One-dimensional image blue sequence ;

[0071]

[0072] in It is a function that transforms a matrix into a matrix of a specified dimension.

[0073] Step 4: From the one-dimensional image red sequence in Step 3 The method of Equation (3) is used to split the high four bits and low four bits of each element in the red sequence of the one-dimensional image to generate a one-dimensional red high-bit sequence. and ;

[0074]

[0075] in This is a function that performs bitwise AND operations, returns a decimal number, and takes a parameter of... , .

[0076] Step 5: Calculate the one-dimensional red high-order sequence obtained in Step 4. Turn to Red high-order matrix , Turn to Red low-order matrix As shown in formula (4);

[0077]

[0078] Step Six: Obtain the red high-order matrix from Step Five. and red low-order matrix Scramble them separately, for use The transformation is scrambled, and the result is... Using different parameters The transformation is performed to scramble the matrix, resulting in two scrambled matrices with red high-order positions. and the red low-position random matrix As shown in equation (5);

[0079]

[0080] in It is an image scrambling algorithm, parameters .

[0081] Step 7: Randomize the red high-position matrix described in Step 6. and the red low-position random matrix Converted into two one-dimensional sequences The sequence is processed according to formula (6). Perform sequential value retrieval on the sequence By reversing the order of values ​​and executing equation (7), the two one-dimensional sequences are combined into one. Red component scrambling matrix ;

[0082]

[0083]

[0084] in, For matrix The elements in For sequence The elements in For sequence The elements in.

[0085] Step 8: Using a hash function Calculate the 512-bit hash value associated with the plaintext and process it as... Initial values ​​of a chaotic key generation system and As shown in equation (8);

[0086]

[0087] SHA-512 is a hash algorithm that performs a hash function on given data, with parameters... .

[0088] Step 9: Use the initial values ​​obtained in Step 8 and Will The chaotic system performs iterative calculations and generates... The three initial chaotic sequences are shown in Equation (9);

[0089]

[0090] Where parameters .

[0091] Step 10: Truncate the initial chaotic sequence generated in Step 9, cutting off a length of... The sequence is truncated as shown in formula (10), and is denoted as the key chaotic sequence. ;

[0092]

[0093] in It is a function that calculates the length of a vector or matrix, with parameters... .

[0094] Step 11: Extract the three key chaotic sequences from Step 10. In Extracted to a length of The sequence to be sorted ,Will Cut length is The sequence to be sorted and length is The sequence to be sorted ,Will Cut length is The sequence to be sorted As shown in formula (11);

[0095]

[0096] Step 12: Sort the four sequences to be sorted generated in Step 11. Using formula (12) to sort from smallest to largest, four sorted sequences are obtained. Compare with the original sequence to be sorted The position in the middle is used to generate four index sequences. As shown in equation (12);

[0097]

[0098] in This is a sorting function that sorts all elements within a given range, defaulting to ascending order.

[0099] Step 13: Green sequence of the one-dimensional image from Step 3 According to formula (14), extract the high four bits and low four bits of each element in the green sequence of the one-dimensional image to generate a one-dimensional green high-bit sequence. and ;

[0100]

[0101] Among them, parameters .

[0102] Step Fourteen: Calculate the one-dimensional green high-order sequence generated in Step Thirteen. and Concatenate them into a one-dimensional green high and low position sequence ,Will Put in a Green scramble matrix In the process, the index sequence generated in step twelve is used. To select elements from the matrix and insert them into the green scrambled matrix. The x and y coordinates of the midpoint are shown in equation (15);

[0103]

[0104] in It is a function that performs shift operations, with parameters... ,parameter ,parameter .

[0105] Step 15: The green scrambling matrix obtained in Step 14... Following the method shown in equation (16), adjacent elements are merged pairwise into one. Green component scrambling matrix ;

[0106]

[0107] Step 16: Blue the one-dimensional image sequence from Step 3. According to formula (17), the high four bits and low four bits of each element in the blue sequence of the one-dimensional image are extracted to generate a one-dimensional blue high-bit sequence. and ;

[0108]

[0109] Step 17: Calculate the one-dimensional blue high-order sequence generated in Step 16. and Concatenate them into a one-dimensional green high and low position sequence Put it in a Blue scrambled matrix In the process, the index sequence generated in step twelve is used. To select elements from the sequence and insert them into the blue scramble matrix The x and y coordinates of the midpoint are shown in equation (18);

[0110]

[0111] Where parameters ,parameter ,parameter .

[0112] Step 18: The blue scrambling matrix obtained in Step 17... Following the method shown in equation (19), horizontally adjacent elements are merged pairwise into one. Blue component scrambling matrix ;

[0113]

[0114] Step 19: Map the three chaotic sequences X1, Y1, and Z1 extracted in Step 11 to element values ​​in the following formula (20). Three diffusing chaotic sequences between ;

[0115]

[0116] Here, mod() is the modulo function, and floor() is the floor function.

[0117] Step 20: Develop the diffused chaotic sequence generated in Step 19. and Mapped to element value in The two one-dimensional rule selection sequences between and The method is shown in formula (21);

[0118]

[0119] Step 21: Using the sequence generated in Step 20 Select a DNA encoding rule from the DNA encoding rule table, as shown in Figure 3A. This includes eight complementary DNA encoding rules. Converting pixel values ​​to eight-bit binary can be represented by combining the four elements "11", "10", "01", and "00", which can be randomly encoded as the bases "A", "T", "C", and "G" respectively. Decoding then changes the image pixel values. The red component scrambling matrix generated in step seven is then applied. Step 15 generates the green component scrambling matrix. And the scrambling matrix of the blue component generated in step eighteen DNA encoding yields three color component encoding matrices. and ;

[0120] Step 22: Using the sequence generated in step 20 Select a DNA coding rule from the DNA coding rule table and apply it to the chaotic sequence generated in step nineteen. DNA encoding to obtain coding sequences ;

[0121] Step 23: Encode the three color components from Step 21 into a single encoding matrix. and The sequence is converted into three one-dimensional color component coding sequences. Following the DNA addition rule table (Figure 3B), the three color component coding matrices are respectively coupled with the coding sequences generated in step twenty-two. DNA addition yields three one-dimensional addition coding sequences. and ;

[0122] Step 24: Select the sequence using the one-dimensional rule generated in Step 20. Select the DNA decoding rule and apply it to the three additive coding sequences after step twenty-three. and Decoding yields three one-dimensional color component decoding sequences. and ;

[0123] Step 25: Decode the red component sequence generated in Step 24. Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step nineteen Divided into four equal parts, four short chaotic sequences were obtained. and Using formula (22), a diffusion operation is performed, and the four obtained sequences are combined together to obtain the XORed red component diffusion sequence. Then use formula (23) to convert the sequence Turn to Red channel encrypted image ;

[0124]

[0125]

[0126] Among them, parameters .

[0127] Step 26: Decode the green component sequence generated in Step 24. Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step nineteen Divided into four equal parts, four short chaotic sequences were obtained. and The diffusion operation is performed using formula (24), and the four obtained sequences are combined together to obtain the XORed green component diffusion sequence. Then use formula (25) to convert the sequence Turn to Green channel encrypted image ;

[0128]

[0129]

[0130] Step 27: Decode the blue component sequence generated in step 24. Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step nineteen Divided into four equal parts, four short chaotic sequences were obtained. and Using formula (24), a diffusion operation is performed, and the four obtained sequences are combined together to obtain the XORed blue component diffusion sequence. Then use formula (27) to convert the sequence Turn to Blue channel encrypted image ;

[0131]

[0132]

[0133] Step 28: Combine the three color channel encrypted images obtained in steps 25, 26, and 27. and The original encrypted image is obtained. As shown in formula (27);

[0134]

[0135] Step 29: Extract the original encrypted image from Step 28. Each pixel value in the three color channels is converted into an eight-bit binary number, and then each... The pixel values ​​of the three color channels corresponding to a given location can be combined to obtain a... A one-dimensional binary sequence can ultimately yield a... binary matrix As shown in formula (28);

[0136]

[0137] Among them, parameters ,parameter .

[0138] Step 30: User input The values ​​of the two control parameters are used to obtain the control parameters. In this embodiment ;

[0139] Step 31: When the binary matrix obtained in step 29... Corresponding position The elements are At that time, using control parameters A random short sequence is generated using formula (29). Step 30 Control parameters As shown in formula (30), a random control sequence is obtained. ;

[0140]

[0141]

[0142] in, It will be from 1 to A function that randomly arranges integers without duplicate elements.

[0143] Step 32, Generate indivual The zero matrix Each element is 24 bits;

[0144] Step 33: Use the random control sequence generated in step 31 Set the elements of the zero matrix generated in step 32 to 1, and then use the method of formula (31) to... Using the element value as an index, the corresponding Position in a zero matrix Set the value to Finally, we got The value of each element is Bit binary matrix ;

[0145]

[0146] Among them, parameters ,parameter .

[0147] Step 34: For the data generated in step 33... indivual Bit binary Perform the operation of formula (32) on each matrix in the matrix, for each The binary elements are truncated, with the first eight bits used as elements in the red shared image, the middle eight bits as elements in the green shared image, and the last eight bits as elements in the blue shared image, generating... A red shared matrix , Green Sharing Matrix and A blue shared matrix ;

[0148]

[0149] in It is a function used to remove a single dimension from a matrix, with parameters... .

[0150] Step 35: The product generated in step 34... A red shared matrix A green sharing matrix and The elements of each blue shared matrix are converted to decimal, and the operation of formula (33) is performed on each colored shared matrix to generate... Red shared image , Green shared image and Blue shared image ;

[0151]

[0152] in It is a function that converts a binary array to decimal.

[0153] Step 36: The product generated in step 35... A red shared image, A green shared image and The blue shared images are combined using formula (34) to generate the final image. A shadow image As shown in Figure 4, 4D-4H;

[0154]

[0155] Step 37: The product generated in step 36... A shadow image Distribute to Each participant shares storage, when one of them... When one or more participants send their shadow images to the shared image verifier, they can access the original encrypted image. Perform the recovery, as shown in Figure 5.

[0156] This embodiment also includes an image decryption method, which is implemented by the following steps:

[0157] Step 38: Transfer the original encrypted image The three color components are extracted using the method in step two, which are the red channel encrypted images. Green channel encrypted images Blue channel encrypted image .

[0158] Step 39: Convert the encrypted image of the red channel described in Step 38... Green channel encrypted images Blue channel encrypted image The method in step three converts it into a one-dimensional red ciphertext sequence. One-dimensional green ciphertext sequence One-dimensional blue ciphertext sequence ;

[0159] Step 40: Use the user's key as The initial values ​​for the chaotic system are generated by iteratively calculating the equations in step nine. , , Three initial chaotic sequences;

[0160] Step 41: The product generated in Step 40... , , The three initial chaotic sequences are truncated into three key chaotic sequences using the method in step ten. , , ;

[0161] Step 42: Extract the three key chaotic sequences from Step 41. , , In Extracted to a length of The sequence to be sorted ,Will Cut length is The sequence to be sorted and length is The sequence to be sorted ,Will Cut length is The sequence to be sorted ;

[0162] Step 43: Sort the four sequences to be sorted generated in Step 42. , , Arrange them into a sequential sequence from smallest to largest as described in step twelve. , , And generate four index sequences. , , , .

[0163] Step 44: Using the formula from Step 19, convert the four key chaotic sequences generated in Step 41 into... , , Mapped to element value in Three diffusing chaotic sequences between ;

[0164] Step 45: Calculate the one-dimensional red ciphertext sequence generated in step 39. Divided into four short sequences , , , Simultaneously, the diffuse chaotic sequence generated in step forty-four... The four are divided into four short chaotic sequences. , , and The one-dimensional red ciphertext sequence is decrypted using formula (35) to obtain the one-dimensional red component. ;

[0165]

[0166] Step 46: Calculate the one-dimensional green ciphertext sequence generated in step 39. Divided into four short sequences , , , Simultaneously, the diffuse chaotic sequence generated in step forty-four... The four are divided into four short chaotic sequences. , , and The one-dimensional green component is obtained by decrypting the one-dimensional green ciphertext sequence using formula (36). ;

[0167]

[0168] Step 47: The one-dimensional blue ciphertext sequence generated in step 39... Divided into four short sequences , , , Simultaneously, the diffuse chaotic sequence generated in step forty-four... The four are divided into four short chaotic sequences. , , and The one-dimensional blue component is obtained by decrypting the one-dimensional blue ciphertext sequence using formula (35). ;

[0169]

[0170] Step 48: Diffusion sequence generated in step 44 The formula in step 20 maps the element values ​​to... The two one-dimensional rule selection sequences between and ;

[0171] Step 49: Select sequences using the one-dimensional rules generated in Step 48. Select the DNA coding rule from the DNA coding rule table, as shown in 3A of Figure 3, and apply it to the one-dimensional red component sequence generated in step 45. Step 46 generates a one-dimensional green component sequence. Step 47 generates the one-dimensional blue component sequence. DNA encoding yielded three one-dimensional color coding sequences. , ;

[0172] Step 50: Select the sequence using the one-dimensional rules generated in step 48. Select a DNA coding rule from the DNA coding rule table and apply it to the chaotic sequence generated in step 44. DNA encoding to obtain coding sequences ;

[0173] Step 51: According to the DNA addition rule table, as shown in 3B of Figure 3, convert the three color-coded sequences obtained in step 49 into... , Compare with the encoded sequence generated in step fifty. DNA addition yields three one-dimensional color-coded addition sequences. and ;

[0174] Step 52: Select the sequence using the one-dimensional rule generated in step 48. Select the DNA decoding rule and apply it to the three addition coding sequences after step fifty-one. and Decoding yields three one-dimensional color decoding sequences. , and ;

[0175] Step 53: Decode the one-dimensional red sequence obtained in step 52. The high four bits and low four bits are separated using the method in step four to generate a one-dimensional red high-bit sequence. and ;

[0176] Step 54: Calculate the one-dimensional red high-order sequence generated in step 53. and Convert using the formula in step five Red high-order matrix and red low-order matrix ;

[0177] Step 55: Obtain the red high-order matrix from step 54. and red low-order matrix Use the reverse respectively The transformation is reversed and scrambled to obtain two decrypted red high-order inverse scrambled matrices. and the red low-order inverted scrambled matrix ;

[0178] Step 56: Invert and scramble the red high-order bits of the matrix described in Step 55. and the red low-order inverted scrambled matrix Transformed into a one-dimensional red high-order reversed scrambled sequence and one-dimensional red low-order reversed scrambled sequence Follow the steps in step seven to process the sequence. Sequential value selection, for a sequence By reversing the order of values, the two one-dimensional sequences are combined into one. red component ;

[0179] Step 57: Obtain the one-dimensional green decoding sequence from step 52. The high four bits and low four bits are separated using the method in step four to generate a one-dimensional green high-bit sequence. and ;

[0180] Step 58: Calculate the one-dimensional green high-order sequence generated in step 57. and Put the elements in a Green reverse scrambled matrix In the process, the index sequence generated in step forty-three is used. , To select elements from the matrix and put them into Green reversed scrambled sequence As shown in formula (36).

[0181]

[0182] Step 59: For the product generated in step 58 Green reversed scrambled sequence Adjacent elements in the array are merged pairwise to form a single element. One-dimensional green reverse scrambled sequence and transform it into The matrix yields the green component. ;

[0183] Step 60: Obtain the one-dimensional blue decoded sequence from step 52. The high four bits and low four bits are separated using the method in step four to generate a one-dimensional blue high-bit sequence. and ;

[0184] Step 61: Calculate the one-dimensional blue high-order sequence generated in Step 60. and Put the elements in a Blue reverse scrambled matrix In the process, the index sequence generated in step forty-three is used. , To select elements from the matrix and put them into Blue Reversed Scrambled Sequence In the middle, as shown in formula (37);

[0185]

[0186] Step 62: For the product generated in step 61 Blue Reversed Scrambled Sequence Adjacent elements in the array are merged pairwise to form a single element. One-dimensional blue reversed scrambled sequence and transform it into The matrix yields the blue component. ;

[0187] Step 63: Combine the three color components obtained in steps 56, 59, and 62. and To obtain the restored image As shown in formula (38);

[0188]

[0189] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0190] The embodiments described above are merely illustrative of several implementations of the present invention, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of the present invention, and these all fall within the protection scope of the present invention. Therefore, the protection scope of this invention patent should be determined by the appended claims.

Claims

1. A method for securely encoding secret images using DNA, characterized by: This method is implemented by a shared image generator, participants, and a shared image verifier; the method is implemented by the following steps: Step 1, the shared image generator encrypts the original image to obtain the original ciphertext image; Step 2, the original ciphertext image generates n shadow images and transmits them to... Each participant shares the storage. When a participant sends the shadow image to the shared image verification party, the original encrypted image is recovered, and then the original encrypted image is decrypted using a decryption method to obtain the original image. The specific process of generating n shadow images is as follows: Step 21: Convert each pixel value in the three color channels of the original encrypted image obtained in Step 1 into an eight-bit binary number, and then combine the pixel values ​​of the three color channels corresponding to each pixel to obtain... A one-dimensional binary sequence, ultimately yielding a binary matrix Step 22: User input The values ​​of the two control parameters are used to obtain the control parameters. ,in, It is a positive integer, and Steps two and three: When the binary matrix obtained in step two and one... Corresponding position When the element value is equal to 1, use the control parameter Generate a short random sequence Using the control parameters generated in step two two As the truncation length for short random sequences Perform truncation to obtain a random control sequence. Step Two Four: Generation indivual The zero matrix, and the random control sequence described in steps two and three. Set the elements in the zero matrix to 1, and then use... Using the element value as an index, the corresponding Position in a zero matrix Set the value to Finally obtained The value of each element is Bit binary Matrix; Step 25, for the aforementioned indivual Bit binary Each in the matrix The binary elements are truncated, with the first eight bits used as elements in the red shared image, the middle eight bits as elements in the green shared image, and the last eight bits as elements in the blue shared image, ultimately generating... A red shared matrix, A green sharing matrix and A blue shared matrix; Step 26: The matrix obtained in Step 25... A red shared matrix, A green sharing matrix and Convert the elements in the blue shared matrix to decimal to generate... A red shared image, A green shared image and Blue shared image Step 27: The steps described in Step 26 A red shared image, A green shared image and The blue shared images are combined to generate the final product. A shadow image.

2. The DNA-secure encoded secret image sharing method according to claim 1, characterized in that: In step one, the process of obtaining the original encrypted image is as follows: Step 11, select a size of... The original color image is used as the raw image. Three color component operations are performed on the original image, followed by a scrambling operation, to obtain the following results: Red component scrambling matrix Green component scrambling matrix and the blue component scrambling matrix Steps 1 and 2: Calculate the hash value of the original image using a hash function and process it as the initial value for the chaotic key generation system. and ; using the initial value and Iterative calculations are performed on the chaotic system to generate initial chaotic sequences. ； Step 13: For the initial chaotic sequence Perform a truncation operation, cutting off a length of... The sequence is denoted as the key chaotic sequence. ; for the truncated key chaotic sequence In Extracted to a length of The sequence to be sorted ,Will Cut length is The sequence to be sorted and length is The sequence to be sorted ,Will Cut length is The sequence to be sorted Step 14: Sort the four sequences to be sorted obtained in Step 13. Sort the data in ascending order to obtain the sorted sequence. ； Compare with the original sequence to be sorted The position in the middle generates four index sequences. Step 15: Map the chaotic key sequences X1, Y1, and Z1 described in Step 13 to element values ​​in... Diffusion chaotic sequence between The diffuse chaotic sequence and Mapped to element value in One-dimensional rule selection sequence between and Step 16: Selecting sequences using one-dimensional rules Referring to the DNA coding rule table, select the DNA coding rule for the three-channel sequence and the diffusion chaotic sequence generated in step one and five. Random coding was performed, and the three coding sequences were added to the diffusion chaos coding sequence according to the DNA addition rule table to obtain three additive coding sequences. and Step 17: Select the sequence using the one-dimensional rule generated in Step 15. Select the DNA decoding rule and apply it to the three additive coding sequences obtained in step one six. and Decoding is performed to obtain three one-dimensional red component decoding sequences. Green component decoding sequence and blue component decoding sequence Step 18: Decode the red component sequence obtained in Step 17. Green component decoding sequence and blue component decoding sequence These correspond to the chaotic sequences obtained in step one and five, respectively. After performing diffusion and merging operations, the final result is a set of lengths. Red channel encrypted image Green channel encrypted images and blue channel encrypted image ； Step 19: Obtain the ciphertext image of the red channel obtained in Step 18. Green channel encrypted images and blue channel encrypted image Merge the images to obtain the original encrypted image.

3. The DNA-secure encoded secret image sharing method according to claim 2, characterized in that: In step one, the scrambling matrix of the red component is obtained. The specific process is as follows: Step A1: Divide the original image Image described in Step 1 into three color components, namely the red component. Green components Blue component The red component Green components Blue component Converted into one-dimensional image red sequences respectively One-dimensional image green sequence One-dimensional image blue sequence ； Step A2: Split the red sequence of the one-dimensional image. Generate a one-dimensional red high-order sequence from the high four bits and low four bits of each element. and one-dimensional red low-order sequence The one-dimensional red high-order sequence Turn to Red high-order matrix The one-dimensional red low-order sequence Turn to Red low-order matrix ； Step A3: The red high-order matrix and red low-order matrix Scramble the matrix separately to obtain the scrambled red high-position matrix. and the red low-position random matrix ; Randomize the red high-position matrix and the red low-position random matrix Converted into two one-dimensional sequences and for one-dimensional sequences Perform sequential value selection on a one-dimensional sequence. By reversing the order of values, the two one-dimensional sequences are combined into one. Red component scrambling matrix 。 4. The DNA-secure encoded secret image sharing method according to claim 3, characterized in that: In step one, the green component scrambling matrix is ​​obtained. The specific process is as follows: Step B1, split the one-dimensional image green sequence in step A1. Generate a one-dimensional green high-order sequence from the high four bits and low four bits of each element. and one-dimensional green low-order sequence Step B2: The one-dimensional green high-order sequence described in step B1 and one-dimensional green low-order sequence Put in a Green scramble matrix In this process, the index sequence described in step one four is used. To select elements from the sequence and insert them into the green scramble matrix The x and y coordinates of the middle position; Step B3, the green scrambling matrix obtained in step B2. Horizontally adjacent elements are merged into one. Green component scrambling matrix 。 5. The DNA-secure encoded secret image sharing method according to claim 3, characterized in that: In step one, the scrambling matrix of the blue component is obtained. The specific process is as follows: Step C1, split the one-dimensional image blue sequence in step A1. The high four bits and low four bits of each element in the sequence are used to generate a one-dimensional blue high-order sequence. and one-dimensional blue low-order sequence Step C2: The one-dimensional blue high-order sequence described in step C1 and one-dimensional blue low-order sequence Put in a Blue scrambled matrix In this process, the index sequence described in step one four is used. To select elements from the sequence and insert them into the blue scramble matrix The x and y coordinates of the middle position; Step C3, the blue scrambled matrix obtained in step C2. Vertically adjacent elements are merged into one. Blue component scrambling matrix 。 6. The DNA-secure encoded secret image sharing method according to claim 2, characterized in that: The specific process of step one six is ​​as follows: Step D1, take the sequence Select a DNA coding rule from the DNA coding rule table and scramble the red component matrix generated in each step. Green component scrambling matrix and the blue component scrambling matrix DNA encoding is performed to obtain the color component coding matrix. and Step D2: The sequence Select a DNA coding rule from the DNA coding rule table and apply it to the diffusion chaotic sequence described in step one five. DNA encoding is performed to obtain the coding sequence. ； Step D3: The color component encoding matrix described in step D1 and This is converted into three one-dimensional color component coding sequences, and then processed according to the DNA addition rule table and the coding sequences generated in step D2. DNA addition was performed to obtain three one-dimensional addition coding sequences. and 。 7. The DNA-secure encoded secret image sharing method according to claim 2, characterized in that: In step 18, the ciphertext image of the red channel is obtained. The specific process is as follows: decode the red component sequence obtained in step one seven. Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step one five Divide into four equal parts to obtain four short chaotic sequences and The diffusion operation is performed using the following formula: In the formula, the parameters ； Obtain the red component diffusion sequence Then the red component is diffused sequence Turn to Red channel encrypted image 。 8. The DNA-secure encoded secret image sharing method according to claim 2, characterized in that: In step 18, the green channel encrypted image is obtained. The specific process is as follows: decode the green component sequence generated in step one seven. Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step one five Divided into four equal parts, four short chaotic sequences were obtained. and The diffusion operation is performed using the following formula: In the formula, the parameters ； Obtain the green component diffusion sequence Then the green component diffusion sequence Turn to Green channel encrypted image 。 9. The DNA-secure encoded secret image sharing method according to claim 2, characterized in that: In step 18, the ciphertext image of the blue channel is obtained. Decode the blue component sequence generated in step 17 Divide into four equal parts to obtain four short sequences and At the same time, the chaotic sequence generated in step one five Divided into four equal parts, four short chaotic sequences were obtained. and The diffusion operation is performed using the following formula: In the formula, the parameters ; Obtain the blue component diffusion sequence Then the blue component is diffused sequence Turn to Blue channel encrypted image 。

Images