CN113612899A - Image encryption method based on RNA and pixel depth - Google Patents
Image encryption method based on RNA and pixel depth Download PDFInfo
- Publication number
- CN113612899A CN113612899A CN202110843783.XA CN202110843783A CN113612899A CN 113612899 A CN113612899 A CN 113612899A CN 202110843783 A CN202110843783 A CN 202110843783A CN 113612899 A CN113612899 A CN 113612899A
- Authority
- CN
- China
- Prior art keywords
- rna
- image
- dimensional
- pair
- chaotic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/44—Secrecy systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/001—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
Abstract
An image encryption method based on RNA and pixel depth belongs to the field of information encryption. The current network transmission safety problem is increasingly severe, and in order to protect network interactive image content, the invention provides an image encryption method based on RNA and pixel depth. Firstly, layering a plaintext image and then carrying out RNA (ribonucleic acid) coding; secondly, scrambling the layered RNA image by using the chaotic sequence, and performing three-dimensional adaptive Arnold transformation and RNA decoding on the scrambling result to obtain a scrambled image; thirdly, RNA encoding is carried out on the scrambled image; secondly, diffusing the selected RNA chaotic matrix and the scrambled RNA image by using an RNA operator; and finally, carrying out RNA decoding on the diffusion result to obtain a final ciphertext image. The experimental results show that: the method has the advantages of wide application range, good encryption effect and high safety, and can ensure safe and reliable transmission of the image under a network platform.
Description
Technical Field
The method relates to an information encryption technology, in particular to an image encryption method.
Background
With the development of network technology, the communication mode is changed greatly, a large number of digital images are transmitted through a network, but the openness of a network system and a network protocol have defects, so that image information leakage events occur frequently; based on this, researchers have proposed various image encryption methods, and these methods have the problems of weak encryption security or low efficiency; in combination with technologies such as an RNA theory, two-dimensional Improved Logistic-Adjusted-Sine Map (ILASM) chaos, pixel depth, four-dimensional Chen hyperchaos and the like, the image encryption method based on the RNA and the pixel depth is designed for improving the safety and the efficiency of the image encryption method and ensuring the safe and efficient transmission of image contents; the method utilizes the good randomness and complexity of the chaotic system, and can effectively protect the network transmission and storage safety of the interactive image.
Disclosure of Invention
The purpose of the invention is as follows: the image encryption method based on the RNA and the pixel depth is provided aiming at the problems that most of current image encryption algorithms are not universal, cannot be applied to images with different pixel depths, cannot achieve one-image one-key and one-time one-key, and is low in safety performance.
The technical scheme of the invention is as follows: in order to realize the purpose, the technical scheme adopted is an image encryption method based on RNA and pixel depth.
The encryption steps are as follows:
step 1: and (3) key generation: let the plaintext image beI m n×Pixel depth ofdRandom selection ofx ' 0, y ' 0, z ' 0, u ' 0, v ' 0, w ' 0,μ ', e', t 'As the user key input, the initial values of the two-dimensional ILASM and the four-dimensional Chen hyperchaotic are calculated by using the key generatorx 0, y 0, z 0, u 0, v 0, w 0And control parametersμ, eAnd the number of iterations of the three-dimensional adaptive Arnold transformtAnd control parametersq 1, q 2；
Step 2: chaotic sequence and matrix generation: according to the initial valuex 0, y 0And control parametersμGenerating 2 two-dimensional ILASM chaotic sequencesX m n d/××2AndY m n d/××2(ii) a According to the initial valuez 0, u 0, v 0, w 0And control parameterseGenerating 4 four-dimensional Chen hyperchaotic matrixesZ m n×, U m n×, V m n×AndW m n×；
and step 3: generation of coding rules: the 8 kinds of coding and decoding of RNA are shown in figure 1 according to the initial value of chaosx 0, y 0, z 0, u 0, v 0, w 0And pixel depthdPerform certain operation generationr 1, r 2, r 3, r 4, r 5, r 6Six encoding and decoding rules;
and 4, step 4: three-dimensional RNA cube generation: using RNA coding rulesr 1To pairI m n×Coding RNA to obtainI 3DThickness pair according to one RNA codeI 3DLayering to obtain RNA layered imageI j R（j=1, 2, …, d2); using chaotic sequencesXTo pairI j R（j=1, 2, …, d/2) interlayer scrambling is performedd2 pieces of size ofm×nOf (2) planeI j 1 （j=1, 2, …, d2); each plane isI j 1Converted into corresponding one-dimensional vectorsV j 1And connected end to obtain a large one-dimensional vectorV 1Using chaotic sequencesYTo pairV 1Carry out integral scrambling to obtainV 2(ii) a Will be provided withV 2Is converted intol×l×lThree-dimensional RNA cube ofI 3DC；
And 5: self-adaptive stereo scrambling: to pairI 3DCScrambled RNA cuboids by three-dimensional adaptive Arnold transformationI 3DAWill be three-dimensionalI 3DAConversion to one-dimensional RNA sequencesV 3After deleting redundant zero codes, utilizer 2To pairV 3Performing RNA decoding and converting into sizem×nTwo-dimensional scrambling ofImage of a personI 2；
Step 6: defining the RNA operation rule: defining the operation rules of RNA addition (+), subtraction (-), XOR (and ^) and XNOR (☉):
and 7: operator selection: respectively selectI 2Middle 4 vertices according to the coding ruler 3RNA coding is carried out on the upper six bits of the pixel value, and the operator +, -, (ii) or ☉ is selected according to the distribution condition of the coding result in the amino acid sequence generation table;
and 8: selecting a chaotic matrix: according todThe calculation result of/8 determines the selection rule and selects the chaos matrixZ, U, V, WA plurality of matrixes in (1) participate in the operation;
and step 9: selective diffusion: will scramble the imageI 2Becomes an image every 8 bitsI i 2（i=1, 2, …, d/8) use ofr 4To pairI i 2（i=1, 2, …, d/8) coding of RNAI i 3（i=1, 2, …, d8); by usingr 5To pairZ, U, VAndWcoding RNAZ 1, U 1, V 1AndW 1then, according to the operator selected in step 7, the operator and the image are subjected to diffusion operation to obtain a layered encrypted imageI 1 e, I 2 e, I 3 eAndI 4 ewill beI 1 e, I 2 e, I 3 eAndI 4 ecombining to obtain encrypted RNA imageI e(ii) a Finally, user 6To pairI ePerforming RNA decoding to obtain ciphertext imageI c。
Further, in step 1, the two-dimensional ILASM means
Wherein the control parameterμ∈[0, 1]Value of statex i , y i ∈[0, 0.2]。
Further, in the step 1, the four-dimensional Chen hyperchaotic index
Wherein the parameter is controlleda=35，b=3，c=12，d=7 ande∈[0.085, 0.798]when the system is in a hyperchaotic state.
Further, in step 1, in order to generate the key, the plaintext image is calculated by using SHA-256 respectivelyI m n×256 bit hash value corresponding to current system timeH 1=j 1, j 2, …, j 256AndH 2=k 1, k 2, …, k 256will beH 1AndH 2respectively taking the first 128 bits and sequentially connecting the first 128 bits into a Hash code with the length of 256 bitsH=j 1, j 2, …, j 128, k 1, k 2, …,k 128And will beHDividing into blocks according to every 8 bitsH=h 1, h 2, …, h 32。
Further, in the step 1, initial values of the two-dimensional ILASM and the four-dimensional Chen hyperchaotic are calculatedx 0, y 0, z 0, u 0, v 0, w 0And control parametersμ, eAnd the number of iterations of the three-dimensional adaptive Arnold transformtAnd control parametersq 1, q 2：
Wherein the content of the first and second substances,mod(.) represents a modular operation,floor(.) represents a rounded-down function,bin2dec(.) indicates a binary converted decimal function, an exclusive or operation.
Further, in the step 2, according to the initial valuex 0, y 0And control parametersμIteration two-dimensional ILASM chaos 1000+m×n×d/Discarding the first 1000 iteration values to generate 2 chaotic sequencesX m n d/××2AndY m n d/××2(ii) a According to the initial valuez 0, u 0, v 0, w 0And control parameterseIteration four-dimensional Chen hyperchaotic 1000+m×nAnd discarding the first 1000 iteration values to generate 4 chaotic matrixesZ m n×, U m n×, V m n×AndW m n×。
further, the six coding and decoding rules in step 3 refer to:
r 1=mod(d+floor(x 0×1014), 8)+1， （6）
r 2=mod(d+floor(y 0×1014), 8)+1， （7）
r 3=mod(d+floor(z 0×1014), 8)+1， （8）
r 4=mod(d+floor(u 0×1014), 8)+1， （9）
r 5=mod(d+floor(v 0×1014), 8)+1， （10）
r 6=mod(d+floor(w 0×1014), 8)+1 （11）。
further, in the step 4, a layer random finger is arranged: use ofsort(.) pairs of functionsXSequencing to obtain new sequenceX 'And a sequence of index valuesP 1：
[X ', P 1]=sort(X(j))， j=1, 2, …, d/2， （12）
Using index valuesP 1To pairI 3DIs scrambled to obtainI j 1：
I j 1=I P1(j) R, j=1, 2, …, d/2 （13）。
Further, in the step 4, the overall random finger is placed: use ofsort(.) pairs of functionsYSequencing to obtain new sequenceY 'And a sequence of index valuesP 2：
[Y ', P 2]=sort(Y(k))，k=1, 2, …, m×n×d/2， （14）
The scrambled plane of each layerI j 1Converted into corresponding one-dimensional vectorsV j 1And are connected end to form a largeIs a one-dimensional vector ofV 1：
V 1=V 1 1 V 2 1…V j 1， （15）
Reusing index valuesP 2To pairV 1Scrambling to obtainV 2：
V 2(k)=V 1(P 2(k))，k=1, 2, …, m×n×d/2， （16）
Will be provided withV 2Is converted intol×l×lThree-dimensional RNA cube ofI 3DCIf the third power can not be fully opened, zero padding is carried out at the tail until the length of the third power is matched:
wherein the content of the first and second substances,ceil (.) represents an rounding-up function.
Further, in the step 5, the three-dimensional adaptive Arnold transformation means:
further, in the step 8, the selection rule is: if it isdAnd 8=1, selecting the first chaotic matrixZParticipating in operation; if it isd8=2, then the first two chaotic matrixes are selectedZAndUparticipating in operation; if it isd8=3, then the first three chaotic matrices are selectedZ, UAndVparticipating in operation; if it isd8=4, then all four chaotic matrices are selectedZ, U, VAndWparticipating in operation; .
Further, in step 9, the diffusion operation means:
whereinoperator1，operator2，operator3 andoperator4 represents one of the four operators, +, -, and ☉.
In the decryption process, the same chaotic sequence and a corresponding RNA coding mode are utilized to process the ciphertext image, the original image can be recovered, and the decryption process is the reverse process of encryption.
Has the advantages that: aiming at the problems that the current partial image encryption algorithm has no universality, cannot be applied to images with different pixel depths, cannot realize one-image one-cipher and one-time one-cipher, has low safety performance and the like, the image encryption method based on RNA and pixel depths is provided; the main contributions are: (1) in order to change the pixel position, a scrambling method suitable for different pixel depth images is constructed by combining an RNA encryption theory and a chaos theory; (2) in order to change the pixel value, a diffusion method suitable for different pixel depth images is designed by combining an RNA encryption theory, a chaos theory and a pixel depth correlation theory; (3) the method utilizes good randomness and complexity of a two-dimensional ILASM chaotic system and a four-dimensional Chen hyperchaotic system, and improves the encryption effect; therefore, the method has the characteristics of high efficiency, safety and good encryption effect, and can effectively protect the safety of network transmission and storage of the interactive images.
Drawings
FIG. 1: 8 coding/decoding rules for RNA sequences;
FIG. 2: RNA operation rules;
FIG. 3: amino acid type and operator correspondence table;
FIG. 4: amino acid codon table;
FIG. 5: a flow chart of an image encryption method based on RNA and pixel depth;
FIG. 6: a plaintext image;
FIG. 7: and (4) ciphertext images.
Detailed Description
The following detailed description of the embodiments of the present invention is provided in connection with the accompanying drawings and examples.
Fig. 5 is an encryption flow diagram of the present method.
The programming software adopted is Matlab R2016a, and 8BPP (bit Per Pixel) Lena gray scale images with the size of 512 x 512 shown in FIG. 6 are selected as experimental objects.
Step 1: respectively calculating hash values of a plaintext image and the current system time by using SHA-256H 1AndH 2(ii) a Will be provided withH 1AndH 2respectively taking the first 128 bits and integrating into 1 Hash code with the length of 256 bitsH=9390454675d1f5e55b046d30f05
a8ea1532c6b269a303ac19d3d0a906bb5e 250; and combined with selectedx ' 0=0.9865, y ' 0=1.4335, z ' 0=1.4977, u ' 0=0.5501, v ' 0=2.5159, w ' 0=1.3714, μ ’=1.6686, e '=0.2759, t '=2.5568 calculating initial values of two-dimensional ILASM and four-dimensional Chen hyperchaotic according to equations (3) - (5)x 0, y 0, z 0, u 0, v 0, w 0And control parametersμ, eAnd the number of iterations of the three-dimensional adaptive Arnold transformtAnd control parametersq 1, q 2 。
Step 2: according to the initial valuex 0, y 0And control parametersμIterating the two-dimensional ILASM chaos for 1000+512 multiplied by 4 times, discarding the first 1000 iteration values, and generating 2 chaos sequencesX, Y(ii) a According to the initial valuez 0, u 0, v 0, w 0And control parameterseIterating the four-dimensional Chen hyperchaotic 1000+512 × 512 times, discarding the first 1000 iteration values, and generating 4 chaos matrixesZ, U, V, W。
And step 3: generation of coding rules: according to the initial value of chaosx 0, y 0, z 0, u 0, v 0, w 0And pixel depthd=8 generated by performing a predetermined operationr 1, r 2, r 3, r 4, r 5, r 6Six coding and decoding rules.
And 4, step 4: three-dimensional RNA cube generation: using coding rulesr 1To pairIRNA coding is carried out to obtain a three-dimensional RNA coding matrix with the size of 512 multiplied by 4I 3D(ii) a Making each layer one layer thick, using chaotic sequencesXTo pairI 3DThe interlamination can be carried out to obtain 4 planes with the size of 512 multiplied by 512I j 1（j=1, 2, …, 4); each plane isI j 1Converted into corresponding one-dimensional vectorsV j 1And connected end to obtain a large one-dimensional vectorV 1Using chaotic sequencesYTo pairV 1Scrambling to obtainV 2(ii) a After zero padding, willV 2Conversion into three-dimensional RNA cubes of size 102X 102I 3DC。
And 5: self-adaptive stereo scrambling: to pairI 3DCScrambled RNA cuboids by three-dimensional adaptive Arnold transformationI 3DAWill be three-dimensionalI 3DAConversion to one-dimensional RNA sequencesV 3After deleting redundant zero codes, utilizer 2To pairV 3Decoding RNA and converting into two-dimensional scrambled image with size of 512 x 512I 2。
Step 6: defining the RNA operation rule: rules for RNA addition, subtraction, XOR and XNOR operations are defined.
And 7: operator selection: respectively selectI 2Middle 4 vertexes and rules the upper six bits of the pixel valuesr 3According to the distribution of the coding result in the amino acid sequence generation table, the corresponding operator is selected.
And 8: selecting a chaotic matrix: according tod/8=1, the first chaotic matrix is selectedZAnd (6) participating in operation.
And step 9: selective diffusion: will be provided withI 2Change of every 8 bitsImagingI i 2 （i= 1) usingr 4Coding it with RNAI i 3(ii) a By usingr 5The chaos matrix participating in the operation is subjected to RNA coding to obtainZ 1Then, according to the operator selected in step 7, the operator and the image are subjected to corresponding diffusion operation to obtain a layered encrypted imageI 1 eI.e. encrypting RNA imagesI e(ii) a Finally, user 6To pairI eThe RNA decoding is performed to obtain a ciphertext image as shown in FIG. 7I c。
According to the decryption process, the same key, the same index and the same chaos are used to decrypt the ciphertext image to obtain a decryption result, which is as shown in fig. 6.
Claims (3)
1. The image encryption method based on the RNA and the pixel depth is characterized by comprising the following steps:
step 1: and (3) key generation: let the plaintext image beI m n×Pixel depth ofdRandom selection ofx ' 0, y ' 0, z ' 0, u ' 0, v ' 0, w ' 0,μ ', e', t 'As user key input, using SHA-256, plaintext image is calculated respectivelyI m n×And current system timeSCorresponding 256 bit hash valueH 1=j 1, j 2, …, j 256AndH 2=k 1, k 2, …, k 256will beH 1AndH 2respectively taking the first 128 bits and sequentially connecting the first 128 bits into a Hash code with the length of 256 bitsH=j 1, j 2, …, j 128, k 1, k 2, …, k 128And will beHDividing into blocks according to every 8 bitsH=h 1, h 2, …, h 32(ii) a Calculating initial values of Improved two-dimensional Logistic-Adjusted Sine Map (ILASM) shown in formula (1) and four-dimensional Chen hyperchaotic shown in formula (2) by using key generators shown in formulas (3) to (5)x 0, y 0, z 0, u 0, v 0, w 0And control parametersμ, eAnd the number of iterations of the three-dimensional adaptive Arnold transform as shown in equation (6)tAnd control parametersq 1, q 2；
Wherein the control parameterμ∈[0, 1]Value of statex i , y i ∈[0, 0.2]；
Wherein the parameter is controlleda=35，b=3，c=12，d=7 ande∈[0.085, 0.798]when the system is in a hyperchaotic state;
wherein the content of the first and second substances,mod (.) represents a modular operation,floor(.) represents a rounded-down function,bin2dec(.) indicates a binary converted decimal function, an indicates an exclusive-or operation;
step 2: chaotic sequence and matrix generation: according to the initial valuex 0, y 0And control parametersμIteration two-dimensional ILASM chaos 1000+m×n×d/2Abandoning the first 1000 iteration values to generate 2 chaotic sequencesX m n d/××2AndY m n d/××2(ii) a According to the initial valuez 0, u 0, v 0, w 0And control parameterseIteration four-dimensional Chen hyperchaotic 1000+m×nAnd discarding the first 1000 iteration values to generate 4 chaotic matrixesZ m n×, U m n×, V m n×AndW m n×；
and step 3: generation of coding rules: according to the initial value of chaosx 0, y 0, z 0, u 0, v 0, w 0And pixel depthdThe rules for generating the RNA codec using equations (7) - (12) are:
r 1=mod(d+floor(x 0×1014), 8)+1， （7）
r 2=mod(d+floor(y 0×1014), 8)+1， （8）
r 3=mod(d+floor(z 0×1014), 8)+1， （9）
r 4=mod(d+floor(u 0×1014), 8)+1， （10）
r 5=mod(d+floor(v 0×1014), 8)+1， （11）
r 6=mod(d+floor(w 0×1014), 8)+1； （12）
and 4, step 4: three-dimensional RNA cube generation: using RNA coding rulesr 1To pairI m n×Coding RNA to obtainI 3DThickness pair according to one RNA codeI 3DLayering to obtain RNA layered imageI j R（j=1, 2, …, d2); using chaotic sequencesXTo pairI j R（j=1, 2, …, d/2) performing interlayer scrambling to obtaind2 pieces of size ofm×nOf (2) planeI j 1（j=1, 2, …, d2); each plane isI j 1Converted into corresponding one-dimensional vectorsV j 1And connected end to obtain a large one-dimensional vectorV 1Using chaosYTo pairV 1Carry out integral scrambling to obtainV 2(ii) a Will be provided withV 2Is converted intol×l×lThree-dimensional RNA cube ofI 3DCIf the third power can not be fully opened, zero codes are filled at the tail to the length which accords with the full third power;
wherein the content of the first and second substances,ceil (.) represents an rounding-up function;
and 5: adaptive stereo scrambling: to pairI 3DCThe three-dimensional adaptive Arnold transformation shown in the formula (6) is performed to obtain the scrambled RNA cubeI 3DAWill be three-dimensionalI 3DAConversion to one-dimensional RNA sequencesV 3After deleting redundant zero codes, utilizer 2To pairV 3Performing RNA decoding and converting into the size ofm×nTwo-dimensional scrambled image ofI 2；
Step 6: defining the RNA operation rule: the rules for addition (+), subtraction (-), exclusive or (≧) and exclusive or (☉) of RNA are defined as follows:
and 7: operator selection: respectively selectI 2Middle 4 vertexes and using coding rulesr 3RNA coding is carried out on the upper six bits of the pixel value, and the operator +, -, (ii) or ☉ is selected according to the distribution condition of the coding result in the amino acid sequence generation table;
and 8: selecting a chaotic matrix: according todThe calculation result of/8 determines the selection rule and selects the chaos matrixZ, U, VAndWparticipating in operation, and selecting the rule as follows: if it isdAnd 8=1, selecting the first chaotic matrixZParticipating in operation; if it isd8=2, then the first two chaotic matrixes are selectedZAndUparticipating in operation; if it isd8=3, then the first three chaotic matrices are selectedZ, UAndVparticipating in operation; if it isd8=4, then all four chaotic matrices are selectedZ, U, VAndWparticipating in operation;
and step 9: selective diffusion: will scramble the imageI 2Becomes an image every 8 bitsI i 2（i=1, 2, …, d/8) use ofr 4To pairI i 2（i=1, 2, …, d/8) coding of RNAI i 3（i=1, 2, …, d8); by usingr 5To pairZ，U，VAndWcoding RNAZ 1，U 1，V 1AndW 1then, according to the operator selected in step 7, the two are subjected to diffusion operation as shown in formula (14) to obtain a layered encrypted imageI 1 e, I 2 e, I 3 eAndI 4 ewill beI 1 e, I 2 e, I 3 eAndI 4 ecombining to obtain encrypted RNA imageI e(ii) a Finally, user 6To pairI ePerforming RNA decoding to obtain ciphertext imageI c；
Whereinoperator1，operator2，operator3 andoperator4 represents one of the four operators, +, -, and ☉.
2. The method of claim 1, wherein: in the step 4, a disorder finger is arranged between layers: use ofsort(.) pairs of functionsXSequencing to obtain new sequenceX 'And a sequence of index valuesP 1：
[X ', P 1]=sort(X(j))， j=1, 2, …, d/2， （15）
Using index valuesP 1To pairI 3DIs scrambled to obtainI j 1：
I j 1=I P1(j) R， j=1, 2, …, d/2 （16）。
3. The method of claim 1, wherein: in the step 4, overall random finger placement: use ofsort(.) pairs of functionsYSequencing to obtain new sequenceY 'And a sequence of index valuesP 2：
[Y ', P 2]=sort(Y(k))，k=1, 2, …, m×n×d/2， （17）
The scrambled plane of each layerI j 1Converted into corresponding one-dimensional vectorsV j 1And are connected end to obtain a large one-dimensional vectorV 1：
V 1=V 1 1 V 2 1…V j 1， （18）
Reusing index valuesP 2To pairV 1Scrambling to obtainV 2：
V 2(k)=V 1(P 2(k))，k=1, 2, …, m×n×d/2 （19）。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110843783.XA CN113612899A (en) | 2021-07-26 | 2021-07-26 | Image encryption method based on RNA and pixel depth |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110843783.XA CN113612899A (en) | 2021-07-26 | 2021-07-26 | Image encryption method based on RNA and pixel depth |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113612899A true CN113612899A (en) | 2021-11-05 |
Family
ID=78305362
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110843783.XA Withdrawn CN113612899A (en) | 2021-07-26 | 2021-07-26 | Image encryption method based on RNA and pixel depth |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113612899A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115134475A (en) * | 2022-08-31 | 2022-09-30 | 智联信通科技股份有限公司 | Weighing apparatus weight discrimination intelligent management system |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2001296953A1 (en) * | 2000-09-28 | 2002-04-08 | New England Medical Center Hospitals, Inc. | Assays for identifying receptors having alterations in signaling |
| US20110059861A1 (en) * | 2009-09-08 | 2011-03-10 | Nodality, Inc. | Analysis of cell networks |
| WO2012159020A1 (en) * | 2011-05-18 | 2012-11-22 | Philadelphia Health & Education Corporation | Methods of diagnosing neuropathic pain |
| CN104053074A (en) * | 2014-06-18 | 2014-09-17 | 河海大学 | Video watermarking method based on depth image and Otsu segmentation |
| WO2016120440A1 (en) * | 2015-01-29 | 2016-08-04 | Ventana Medical Systems, Inc. | Dot detection, color classification of dots and counting of color classified dots |
| CN109618073A (en) * | 2018-12-05 | 2019-04-12 | 重庆邮电大学 | A kind of more figure encryption methods based on Hyperchaotic Chen System |
| US20200118026A1 (en) * | 2015-08-03 | 2020-04-16 | Nxgen Partners Ip, Llc | Quantum mechanical framework for interaction of oam with matter and applications in solid states, biosciences and quantum computing |
| CN111031193A (en) * | 2020-01-06 | 2020-04-17 | 中国矿业大学 | Image encryption method based on three-dimensional composite scrambling model and chaos |
-
2021
- 2021-07-26 CN CN202110843783.XA patent/CN113612899A/en not_active Withdrawn
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2001296953A1 (en) * | 2000-09-28 | 2002-04-08 | New England Medical Center Hospitals, Inc. | Assays for identifying receptors having alterations in signaling |
| US20110059861A1 (en) * | 2009-09-08 | 2011-03-10 | Nodality, Inc. | Analysis of cell networks |
| WO2012159020A1 (en) * | 2011-05-18 | 2012-11-22 | Philadelphia Health & Education Corporation | Methods of diagnosing neuropathic pain |
| CN104053074A (en) * | 2014-06-18 | 2014-09-17 | 河海大学 | Video watermarking method based on depth image and Otsu segmentation |
| WO2016120440A1 (en) * | 2015-01-29 | 2016-08-04 | Ventana Medical Systems, Inc. | Dot detection, color classification of dots and counting of color classified dots |
| US20200118026A1 (en) * | 2015-08-03 | 2020-04-16 | Nxgen Partners Ip, Llc | Quantum mechanical framework for interaction of oam with matter and applications in solid states, biosciences and quantum computing |
| CN109618073A (en) * | 2018-12-05 | 2019-04-12 | 重庆邮电大学 | A kind of more figure encryption methods based on Hyperchaotic Chen System |
| CN111031193A (en) * | 2020-01-06 | 2020-04-17 | 中国矿业大学 | Image encryption method based on three-dimensional composite scrambling model and chaos |
Non-Patent Citations (4)
| Title |
|---|
| B. AKABAYOV等: "RNA labeling and immobilization for nano-displacement measurement: probing three-dimensional RNA structure", 《IEEE TRANSACTIONS ON NANOBIOSCIENCE 》 * |
| XIAOQIANG ZHANG等: "Adaptive Chaotic Image Encryption Algorithm Based on RNA and Pixel Depth", 《ELECTRONICS》 * |
| ZHANG, DUZHONG等: "Hyper-Chaotic Color Image Encryption Based on Transformed Zigzag Diffusion and RNA Operation", 《ENTROPY》 * |
| 朱贵良等: "基于多级多层置乱的数字图像加密新算法研究", 《信息安全与技术》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115134475A (en) * | 2022-08-31 | 2022-09-30 | 智联信通科技股份有限公司 | Weighing apparatus weight discrimination intelligent management system |
| CN115134475B (en) * | 2022-08-31 | 2022-11-08 | 智联信通科技股份有限公司 | Weighing apparatus weight discrimination intelligent management system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109241755B (en) | Image encryption method based on three-dimensional scrambling model and chaos | |
| Lin et al. | An image encryption scheme based on Lorenz hyperchaotic system and RSA algorithm | |
| CN111031193B (en) | Image encryption method based on three-dimensional composite scrambling model and chaos | |
| CN113297606B (en) | Color quantum image encryption and decryption method based on multiple chaos and DNA operation | |
| CN109150492B (en) | Multi-image encryption method based on three-dimensional scrambling model and chaos | |
| CN106023051B (en) | DNA image encryption method and system based on cloud model and hyperchaotic system | |
| CN116150795B (en) | Homomorphic encryption-based data processing method, system and related equipment | |
| Kumar et al. | Image cryptography with matrix array symmetric key using chaos based approach | |
| CN113612899A (en) | Image encryption method based on RNA and pixel depth | |
| CN113468562B (en) | Image block encryption and decryption method based on fusion of hyperchaotic system and neural network mechanism | |
| Zheng et al. | An ACP-based approach to color image encryption using DNA sequence operation and hyper-chaotic system | |
| CN111682932B (en) | Single-round image encryption method based on mixed chaotic mapping | |
| CN113612596A (en) | Image self-decryption method based on hyperchaotic system | |
| CN113691362A (en) | Bit plane image compression encryption algorithm based on hyperchaotic system and DNA coding | |
| CN113099069B (en) | Multi-image encryption method based on three-dimensional spiral model | |
| Allawi et al. | Color image encryption using LFSR, DNA, and 3D chaotic maps | |
| CN107507254A (en) | Compression of images encryption method based on arithmetic coding | |
| Alhassan et al. | Enhancing image security during transmission using residue number system and k-shuffle | |
| CN113114870B (en) | Multi-image encryption method based on three-dimensional Zigzag model | |
| CN116033086B (en) | Reversible neural network-based image hiding method | |
| Li et al. | Image encryption system based on chaotic system and dna computing | |
| Yuanshi et al. | An algorithm for JPEG compressing with chaotic encrypting | |
| CN114362918A (en) | Image encryption method based on central rule and three-dimensional bit plane | |
| Salunke et al. | An implicit approach for visual data: compression encryption via singular value decomposition, multiple chaos and beta function | |
| CN114422127A (en) | Quantum key distribution system, method, storage device and intelligent terminal integrating image encryption |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20211105 |
|
| WW01 | Invention patent application withdrawn after publication |