CN108122188A - A kind of image encryption method - Google Patents
A kind of image encryption method Download PDFInfo
- Publication number
- CN108122188A CN108122188A CN201810031169.1A CN201810031169A CN108122188A CN 108122188 A CN108122188 A CN 108122188A CN 201810031169 A CN201810031169 A CN 201810031169A CN 108122188 A CN108122188 A CN 108122188A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- mtd
- dna
- mtr
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0053—Embedding of the watermark in the coding stream, possibly without decoding; Embedding of the watermark in the compressed domain
Abstract
The present invention discloses a kind of image encryption method, chaotic maps with DNA encoding is combined, plaintext image is encrypted, including：Generate initial key；Chaos sequence and scramble vector are generated using initial key；Scrambling encryption is carried out to plaintext image using scramble vector, obtains scramble image；DNA encoding is carried out to the chaos sequence, to obtain the first DNA sequence dna and carry out DNA encoding to scramble image, to obtain the second DNA sequence dna；Encryption is diffused to the DNA sequence dna using the first DNA sequence dna, to obtain the 3rd DNA sequence dna；And DNA decodings are carried out to the 3rd DNA sequence dna, to obtain ciphertext graph picture.
Description
Technical field
This application involves image encryption treatment technologies.
Background technology
In the modern life, with the fast development of internet, people all the time can by network issued information,
Although it brings great convenience to our life, we are also faced with the situation that mass data is leaked, distorts.Especially
It is using and propagating for substantial amounts of image information, and more and more people is made to begin to focus on its information security issue.In such as army
In the scenes such as thing operation, e-commerce, medical system and real time monitoring, safe image encryption technology is all relied on.So such as
What ensures that the security of image information has become popular major issue of interest.
There is no the algorithms being encrypted specifically for this special data type of digital picture in cryptography.Encryption is calculated
Method is that clear data is encrypted to ciphertext data so that attacker can not therefrom obtain useful information, so as to reach the mesh of secrecy
's.However the Encryption Algorithm of mainstream, such as Advanced Encryption Standard (Advanced Encryption Standard, AES) and the world
Data encryption algorithm (International Data Encryption Algorithm, IDEA) etc. is mainly used for ciphertext
Data.For digital picture, it is necessary to after encrypted image is changed into one-dimensional binary data, data are carried out as binary stream
Encryption.But since digital picture has the characteristics that redundancy between Two dimensional Distribution, adjacent pixel is high and data volume is big, because
This should take into full account the characteristic of digital picture in itself in ciphering process.Mainstream Encryption Algorithm is directed to the very big figure of data volume
Picture enciphering rate is slow, and efficiency is low, is not suitable for real-time encrypted.
In recent years, since chaotic maps (Chaotic Map) have ergodic, pseudo-randomness, to primary condition and control
The features such as hypersensitivity of parameter, and cost of implementation is low.These characteristics cause a large amount of scholars to generally believe that chaotic maps are applicable in
In image encryption technology.With the development that DNA is studied, DNA sequence dna is applied to image encryption by a large amount of scholars
Field.Therefore, the application of chaotic maps and DNA encoding in image encryption is got growing concern for.
The content of the invention
The present invention is intended to provide the resume image both with realization in terms of security and time efficiency.
The present invention provides a kind of image encryption method, chaotic maps with DNA encoding is combined, plaintext image is added
It is close, preferably include：
Generate initial key；
Chaos sequence and scramble vector are generated using initial key；
Scrambling encryption is carried out to the plaintext image using the scramble vector, obtains scramble image；
DNA encoding is carried out to the chaos sequence, to obtain the first DNA sequence dna and carry out DNA to the scramble image
Coding, to obtain the second DNA sequence dna；
Encryption is diffused to second DNA sequence dna using first DNA sequence dna, to obtain the 3rd DNA sequence dna；With
And
DNA decodings are carried out to the 3rd DNA sequence dna, to obtain ciphertext graph picture.
Preferably, the chaos sequence is based on the first initial key, the 3rd control parameter and the generation of the first constant, it is described to put
Disorderly vector is based on the second initial key, the 4th control parameter and the generation of the second constant.
Preferably, the initial key of generation plaintext image P (m, n) is calculated by formula (1)
Wherein, α1And β1Respectively first, second control parameter, w can be obtained by formula (2)：
Preferably, generate chaos sequence by following steps
By the first initial key (y1(0),y2(0),y3(0),y4(0)) and first group of control parameter a, b, c, d, k conduct are public
The input value of formula (3), the iteration Gao hyperchaotic maps generate the first discrete series yk(k=1,2,3,4)；
By the first discrete series yk(k=1,2,3,4) the first pseudo-random sequence is obtained by formula (4) combinationAnd
By first pseudo-random sequencePreceding N1 pseudo random number cast out, pass through formula (5) willBefore
M*n number changes into the integer sequence between 0~255
Preferably, scramble vector is generated by following steps, including line shuffle vector H and row scramble vector L：
By the second initial keyWith second group of control parameter a, b, c, d, k are as super
The input value of chaotic maps formula (3), the iteration hyperchaotic map generate the second discrete series
By second discrete seriesSecond pseudorandom sequence is obtained by the following formula (6) combination
Row
By second pseudo-random sequencePreceding N2A pseudo-random sequence is cast out, orderAnd
Respectively willIt is ranked up by ascending order, the sequence of the original subscript value after sequence is saved as respectively
Line shuffle vectorWith row scramble vector
Preferably, the scramble vector includes line shuffle vector sum row scramble vector, using scramble vector to plaintext image
Carrying out scrambling encryption includes：Line shuffle processing is carried out to plaintext image using the line shuffle vector；And it is put using the row
Disorderly vector to through line shuffle treated image into ranks disorder processing.
Preferably, carrying out DNA encoding to the chaos sequence includes：The chaos sequence is changed into the first binary system sequence
Row；And first binary sequence is subjected to DNA encoding by the first mapping relations of predetermined DNA encoding rule；
Carrying out DNA encoding to the scramble image includes：The scramble image is converted into second by intended conversion rule
Binary sequence；And second binary sequence is subjected to DNA volumes by the second mapping relations of DNA encoding rule
Code.
Preferably, being diffused encryption to second DNA sequence dna using first DNA sequence dna includes：
By formula (7) and (8), the first DNA sequence dna R is utilizedeIt is right with predetermined add operation and XOR operation rule
Second DNA sequence dna Pe' operation is diffused, obtain the 3rd DNA sequence dna C '：
Preferably, DNA decodings are carried out to the 3rd DNA sequence dna to be included：
DNA decodings are carried out to the DNA sequence dna by the 3rd mapping relations of DNA encoding rule, change into one-dimensional two
System sequence；And
The pixel value that sequence processed is converted by the intended conversion rule ciphertext graph picture is carried out by described one-dimensional two.
The embodiment of the present invention has both security and time efficiency, with key space is big, key sensibility is strong, resists system
The advantages that meter attack and differential attack ability are strong, the possibility of leakage information is small and time complexity is small.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, needed in being described below to the embodiment of the present invention
Attached drawing to be used is briefly described, it should be apparent that, the accompanying drawings in the following description is only some embodiments of the present invention,
For those of ordinary skill in the art, without having to pay creative labor, can also be obtained according to these attached drawings
Obtain other attached drawings.
Fig. 1 shows the image encryption method of one embodiment of the invention；
Fig. 2 shows the image encryption method of another embodiment of the present invention；
Fig. 3 is the key sensitivity tests figure of method shown in Fig. 2；
Fig. 4 is the plaintext image of method shown in Fig. 2 and the histogram of ciphertext graph picture.
Specific embodiment
The embodiment of the present invention is described below in detail, the example of the embodiment is shown in the drawings, wherein from beginning to end
Same or similar label represents same or similar component or has the function of same or like component.Below with reference to attached
The embodiment of figure description is exemplary, it is intended to for explaining the present invention, and is not considered as limiting the invention.
A kind of image encryption method (referred to as IEHDC) based on hyperchaotic map and DNA encoding is proposed in the present invention, it should
Chaotic maps and DNA encoding are combined by method, have higher security than one of which technology is used alone.
One embodiment of the invention provides a kind of image encryption method, including：Chaotic maps are combined with DNA encoding to bright
Texts and pictures picture is encrypted.Refering to Fig. 1, it is described by chaotic maps with DNA encoding be combined plaintext image is encrypted including：
ST1, generation initial key；
ST2, chaos sequence and scramble vector are generated using initial key；
ST3, scrambling encryption is carried out to the plaintext image using the scramble vector, obtains scramble image；
ST4, to the chaos sequence carry out DNA encoding, with obtain the first DNA sequence dna and to the scramble image into
Row DNA encoding, to obtain the second DNA sequence dna；
ST5, encryption is diffused to second DNA sequence dna using first DNA sequence dna, to obtain the 3rd DNA sequences
Row；And
ST6, DNA decodings are carried out to the 3rd DNA sequence dna, to obtain ciphertext graph picture.
Fig. 2 shows the image encryption method of another embodiment of the present invention, wherein, it is necessary to encrypted plaintext image for P (m,
N), this method includes：
S1, generating portion initial keyCan part initial key be calculated by formula (1)
Wherein, α1And β1Parameter in order to control, w can be obtained by formula (2).
S2, generation chaos sequenceCan chaos sequence be generated by following steps S21~S23
S21, by the first initial key (y1(0),y2(0),y3(0),y4(0)) make with first group of control parameter a, b, c, d, k
For the input value of formula (3), the iteration Gao hyperchaotic maps generate the first discrete series yk(k=1,2,3,4).Wherein,
One initial key (y1(0),y2(0),y3(0),y4(0)) it can be self-defined generation.
In an example, a=36, b=3, c=28, d=-16 are worked as, during and -0.7≤k≤0.7, mapping can enter
Hyperchaos state.
S22, the first discrete series y for generating iteration Gao hyperchaotic mapsk(k=1,2,3,4) passes through formula (4) group
Conjunction obtains the first pseudo-random sequence
S23, by the first pseudo-random sequencePreceding N1 pseudo random number cast out, pass through formula (5) willBefore
M*n number changes into the integer sequence between 0~255
S3, generation scramble vector H and L；Can scramble vector H and L be generated by step S31~S34.
S31, by the second initial keyWith second group of control parameter a, b, c, d, k conduct
The input value of hyperchaotic map formula (3), the iteration hyperchaotic map generate the second discrete series
Wherein, the second initial keyIt can be self-defined generation.
S32, the second discrete series for generating iteration Gao hyperchaotic mapsPass through formula (6)
Combination obtains the second pseudo-random sequence
S33, by the second pseudo-random sequencePreceding N2A pseudo-random sequence is cast out, order
S34, respectively willIt is ranked up by ascending order, the sequence of the original subscript value after sequence is protected respectively
Save as line shuffle vectorWith row scramble vector
S4, plaintext image P (m, n) is subjected to scrambling encryption using scramble vector H and L, obtains encrypted scramble image
P′(m,n)；Can scrambling encryption be carried out by step S41 and S42.
S41, line shuffle processing：Utilize line shuffle vectorBy every a line H (i) in plaintext image P (m, n)
It is moved to the i-th ∈ [1, m] rows；
S42, row disorder processing：Utilize row scramble vectorEach row L (j) in image after line shuffle is moved
Move jth ∈ [1, n] row.
S5, to chaos sequenceDNA encoding is carried out respectively with scramble image P ' (m, n), obtains the first DNA sequence dna ReWith
Second DNA sequence dna Pe′；
Wherein, to chaos sequenceCarrying out DNA encoding includes：By chaos sequenceChange into binary sequence
Rb, then by binary sequence RbBy the first mapping relations map of table 11DNA encoding is carried out, obtains the first DNA sequence dna Re。
Carrying out DNA encoding to scramble image P ' (m, n) includes：By P ' (m, n) by order " from top to bottom, from left to right "
Change into one-dimensional binary sequence Pb', then by binary sequence Pb' by the second mapping relations map of table 12Carry out DNA encoding,
Obtain the second DNA sequence dna Pe′。
Wherein, 1≤map1,map2≤ 8, map1And map2Can be optional from 8 kinds of coding rules of table 1, the two can
With it is identical can not also be same.
8 kinds of coding rules of table 1DNA codings
S6, the first DNA sequence dna R is utilizedeTo the second DNA sequence dna Pe' encryption is diffused, obtain the 3rd DNA sequence dna C '；
It can be by formula (7) and formula (8) to Pe' operation is diffused, obtain C '.Wherein, the addition fortune after DNA encoding
It calculates and XOR operation rule is as shown in table 2 and table 3.
The addition rule of table 2DNA sequences
The XOR operation rule of table 3DNA sequences
S7, to the 3rd DNA sequence dna C ' carry out DNA decodings, obtain ciphertext graph as C (m, n)；Can by step S71 and S72 into
Row DNA is decoded.
S71, the 3rd mapping relations map by table 13To the 3rd DNA sequence dna C ' carry out DNA decodings, change into one-dimensional two into
Sequence processed.Wherein, map3Can be optional from 8 kinds of coding rules of table 1, with map1Or map2It can be identical or different.
S72, the binary sequence for carrying out DNA decoding conversions is converted into pixel value；It can be by " from top to bottom, from left to right "
Sequential conversions be size be m × n ciphertext graph as C (m, n).
The embodiment of the present invention is with key space is big, key sensibility is strong, resists statistical attack and differential attack ability
By force, the possibility for revealing information is small and the advantages that time complexity is small.
(1) key space
One good resume image should be able to resist brute force attack.Because only that key space it is sufficiently large when
It waits, attacker cannot pass through exhaustive all secret key decryption ciphertexts within the limited time.At this point, algorithm could support completely
Violence is attacked.In the algorithm, initial key has y1(0),y2(0),y3(0),y4(0),map1,map2,map3,k1,k2,N1,
N2,α1,Deng.If key precision is set to 10~15, the key space of the algorithm is at least
1015×14×83≈2709.Under normal circumstances, it is believed that when the key space of an algorithm is more than 2100When, the Encryption Algorithm is just
Brute force attack can be resisted.But with the fast development of computer hardware, key space is bigger, resists the safety of brute force attack
Property is higher.Therefore, the key space of IEHDC is sufficiently large, it is sufficient to resist brute force attack.
(2) key sensibility
In order to ensure the security of encryption system, key safety should all be divided in encrypting stage and decryption phase
Analysis.One good encryption system should be extreme sensitivity to key.That is, the variation of very little can cause figure in key
As the difference of encryption and decryption.In order to test IEHDC, it is encrypted in encrypting stage using the plaintext of G pairs of key group, wherein one
A keyThere is slightly different key group K that ciphertext is decrypted with G again, whereinOther keys are constant, and obtained decrypted image should differ greatly with original image.
In this regard, We conducted key sensitivity tests, wherein being with " Flower ", " Fruit ", " Girl " and " Tree "
The Encryption Algorithm of example test IEHDC.Plaintext image is encrypted using the key group of G, reuses the key group of K to ciphertext graph
As being decrypted.Experimental result is as shown in Figure 3.It can therefrom draw, use the key solution for there was only minute differences with correct key
Image after close is entirely different with original image, is hardly obtained any useful information.And after using correct secret key decryption
Image is identical with original image.It is very strong to the sensibility of key that this illustrates that we put forward Encryption Algorithm.
(3) histogram analysis
Histogram analysis are a very important features in graphical analysis.Theoretically, a good resume image
Various statistical attacks can be kept out.Histogram reflects the distribution of image number of pixels on grey level.Ciphertext graph picture it is straight
Side's figure is more smooth, and cipher round results are better.It can so cause ciphertext graph picture and original image almost without statistics similarity, it can be with
It is effective to prevent to reveal original image information by statistical attack.As shown in figure 4, with " Boats ", " Fruit ", " Tree " and
The histogram of plaintext image exemplified by " Baboon " and the histogram by the encrypted corresponding ciphertext graph pictures of IEHDC.Clearly
The histogram distribution of all plaintext images has apparent pixel value tag, therefore is easily subject to statistical attack.And ciphertext graph as
Histogram distribution is highly uniform there is no uneven, effectively eliminates the feature that plaintext image is included itself.Therefore,
Ciphertext graph picture can not provide any useful information to attacker and be used for statistical attack analytic process.This illustrates proposition of the present invention
IEHDC there is the ability of powerful resistance statistical attack.
(4) correlation analysis
In image procossing, correlation analysis is often used in the correlation between two adjacent pixels of test.It is understood that
There is very high correlation in plaintext image between adjacent pixel.Therefore, a good resume image should be able to eliminate this
Kind correlation, to resist various statistical attacks.Table 4 shows each plaintext image and warp that are calculated by formula (9)~(12)
Cross the related coefficient of adjacent pixel in the encrypted corresponding ciphertext graph pictures of IEHDC.There it can be seen that the correlation of all plaintext images
Coefficient is all close to 1, and the related coefficient of their ciphertext graph picture is almost 0.When image related coefficient closer to 0 when
It waits, illustrates that the cipher round results of algorithm are better.Therefore, IEHDC has good effect between pixel is eliminated in terms of correlation.
Related coefficient between table 4IEHDC plaintexts and the adjacent pixel of corresponding ciphertext
By taking " Baboon ", " Barbara ", " Flower ", " Dog ", " Fruit " and " Girl " as an example, table 5 shows each bright
Texts and pictures picture and the process encrypted corresponding ciphertext graph pictures of IEHDC are in horizontal, vertical and diagonal pixel distribution situation.Therefrom
As can be seen that the pixel Distribution value of wherein all plaintext images in different directions is all very intensive, illustrate the correlation of its plaintext
Property it is very high, have apparent feature.And the pixel Distribution value of ciphertext graph picture is at random, illustrates that the correlation of ciphertext graph picture is very low.It should
Encryption Algorithm successfully eliminates the high correlation in plaintext image, can be reasonably resistant to various statistical attacks.
The correlation of 5 adjacent pixel of table
Table 5 (continued)
(5) the Analysis of Entropy
In information theory, comentropy is most important randomness measurement standard.The calculation formula of comentropy is represented by
Formula (13)：
Assuming that information source has 28 kinds of states, then：
Wherein n represents the number for the pixel value that needs count, and mi represents pixel value, and p (mi) represents that symbol mi occurs general
Rate.By above formula, it can be seen that in gray level image in units of pixel, when all pixel values are uniformly distributed
When, it is independent of each other between pixel, comentropy maximum is 8.Therefore, the ideal value of the comentropy of encrypted image should be 8.
Closer to 8, the possibility cracked by attacker is with regard to smaller.
As known from Table 6, illustrate that the pixel value of ciphertext graph picture divides all very close to 8 by the comentropy of the encrypted images of IEHDC
The randomness of cloth is very strong.Therefore, the possibility for revealing information is very small.
The comentropy of the plaintext of table 6IEHDC and corresponding ciphertext graph picture
(6) differential attack
Differential attack refers to that, when our changes subtle to original image progress, encrypted ciphertext and ours will be obtained
The encrypted ciphertext of original image is compared and analyzes, and obtains contacting between original image and encrypted image.An if original
Beginning image passes through small change, and obtained ciphertext has very big difference with original cipher text, we just say that the algorithm can be resisted
Differential attack.By the calculating of formula (15) and (17), table 7 shows IEHDC Encryption Algorithm to the encrypted ciphertext of different images
NPCR and UACI values.Therefrom we it can be found that using the encrypted ciphertexts of IEHDC two parameters of NPCR and UACI value all
Respectively close to 100% and 33.5%, illustrate that IEHDC has good cipher round results, there are minute differences to two when using IEHDC
Plaintext image when being encrypted, two obtained ciphertext graph pictures have very big difference.This just effectively avoids attacker and thinks
The possibility of the effective information of plaintext is obtained by comparing ciphertext difference.
Comparison of 7 algorithms of different of table to each image NPCR
(7) time complexity is analyzed
Time complexity is mainly used for the time needed for testing algorithm encrypted image.On the premise of algorithm security, encryption
The time complexity of algorithm should be the smaller the better, can so accelerate enciphering rate, improves user experience.In IEHDC, scramble
Ciphering process needs to generate m+n pseudo random key stream.(m × n) a pseudo random key stream is needed in ciphering process is spread.This
Two processes all only need one cycle that can just complete.Therefore, the time complexity of IEHDC is O (n).
In the description of this specification, reference term " embodiment ", " some embodiments ", " an implementation
The description of example ", " some embodiments ", " example ", " specific example " or " some examples " etc. means to combine the embodiment or example
Particular features, structures, materials, or characteristics described are contained at least one embodiment of the present invention or example.In this explanation
In book, schematic expression of the above terms may not refer to the same embodiment or example.Moreover, the specific spy of description
Sign, structure, material or feature can in an appropriate manner combine in any one or more embodiments or example.
The above content is combine specific embodiment further description made for the present invention, it is impossible to assert this hair
Bright specific implementation is confined to these explanations.For those of ordinary skill in the art to which the present invention belongs, do not taking off
On the premise of from present inventive concept, several simple deduction or replace can also be made.
Claims (10)
1. a kind of image encryption method, which is characterized in that chaotic maps with DNA encoding are combined and are added to plaintext image
It is close.
2. the method as described in claim 1, which is characterized in that described be combined chaotic maps with DNA encoding schemes plaintext
As be encrypted including：
Generate initial key；
Chaos sequence and scramble vector are generated using the initial key；
Scrambling encryption is carried out to the plaintext image using the scramble vector, obtains scramble image；
DNA encoding is carried out to the chaos sequence, to obtain the first DNA sequence dna and carry out DNA volumes to the scramble image
Code, to obtain the second DNA sequence dna；
Encryption is diffused to second DNA sequence dna using first DNA sequence dna, to obtain the 3rd DNA sequence dna；And
DNA decodings are carried out to the 3rd DNA sequence dna, to obtain ciphertext graph picture.
3. method as claimed in claim 2, which is characterized in that the chaos sequence is based on the first initial key, the 3rd control
Parameter and the generation of the first constant, the scramble vector is based on the second initial key, the 4th control parameter and the generation of the second constant.
4. method as claimed in claim 2, which is characterized in that generating portion initial key is calculated by formula (1)
<mrow>
<msub>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msub>
<mrow>
<mo>(</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mrow>
<mo>(</mo>
<mo>(</mo>
<mrow>
<mi>w</mi>
<mi>%</mi>
<mrow>
<mo>(</mo>
<mrow>
<mi>m</mi>
<mo>&times;</mo>
<mi>n</mi>
</mrow>
<mo>)</mo>
</mrow>
</mrow>
<mo>)</mo>
<mo>/</mo>
<mo>(</mo>
<mrow>
<mi>m</mi>
<mo>&times;</mo>
<mi>n</mi>
</mrow>
<mo>)</mo>
<mo>+</mo>
<msub>
<mi>&alpha;</mi>
<mn>1</mn>
</msub>
<mo>)</mo>
</mrow>
<mo>&times;</mo>
<mn>0.3</mn>
<mo>+</mo>
<msub>
<mi>&beta;</mi>
<mn>1</mn>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, α1And β1Respectively first, second control parameter, w can be obtained by formula (2)：
<mrow>
<mi>w</mi>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>m</mi>
<mo>&times;</mo>
<mi>n</mi>
</mrow>
</munderover>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
5. method as claimed in claim 4, which is characterized in that generate chaos sequence by following steps
By the first initial key (y1(0),y2(0),y3(0),y4(0)) and first group of control parameter a, b, c, d, k are as formula (3)
Input value, the iteration Gao hyperchaotic maps, generate the first discrete series yk(k=1,2,3,4)；
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mfrac>
<mrow>
<msub>
<mi>dy</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<mi>d</mi>
<mi>t</mi>
</mrow>
</mfrac>
<mo>=</mo>
<mi>a</mi>
<mrow>
<mo>(</mo>
<mo>-</mo>
<msub>
<mi>y</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<msub>
<mi>y</mi>
<mn>2</mn>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mfrac>
<mrow>
<msub>
<mi>dy</mi>
<mn>2</mn>
</msub>
</mrow>
<mrow>
<mi>d</mi>
<mi>t</mi>
</mrow>
</mfrac>
<mo>=</mo>
<msub>
<mi>dy</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<msub>
<mi>cy</mi>
<mn>2</mn>
</msub>
<mo>-</mo>
<msub>
<mi>y</mi>
<mn>1</mn>
</msub>
<msub>
<mi>y</mi>
<mn>3</mn>
</msub>
<mo>-</mo>
<msub>
<mi>y</mi>
<mn>4</mn>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mfrac>
<mrow>
<msub>
<mi>dy</mi>
<mn>3</mn>
</msub>
</mrow>
<mrow>
<mi>d</mi>
<mi>t</mi>
</mrow>
</mfrac>
<mo>=</mo>
<msub>
<mi>y</mi>
<mn>1</mn>
</msub>
<msub>
<mi>y</mi>
<mn>2</mn>
</msub>
<mo>-</mo>
<msub>
<mi>by</mi>
<mn>3</mn>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mfrac>
<mrow>
<msub>
<mi>dy</mi>
<mn>4</mn>
</msub>
</mrow>
<mrow>
<mi>d</mi>
<mi>t</mi>
</mrow>
</mfrac>
<mo>=</mo>
<msub>
<mi>y</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mi>k</mi>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
</mrow>
By the first discrete series yk(k=1,2,3,4) the first pseudo-random sequence is obtained by formula (4) combinationWith
And
<mrow>
<mtable>
<mtr>
<mtd>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>y</mi>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>y</mi>
<mn>1</mn>
</msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>y</mi>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>+</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>y</mi>
<mn>2</mn>
</msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>y</mi>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>+</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>y</mi>
<mn>3</mn>
</msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>y</mi>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>+</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>y</mi>
<mn>4</mn>
</msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
<mo>,</mo>
<mn>...</mn>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
By first pseudo-random sequencePreceding N1 pseudo random number cast out, pass through formula (5) willPreceding m*n
Number changes into the integer sequence between 0~255
6. method as claimed in claim 5, which is characterized in that by following steps generate scramble vector, including line shuffle to
Measure H and row scramble vector L：
By the second initial keyWith second group of control parameter a, b, c, d, k are reflected as hyperchaos
The input value of formula (3) is penetrated, the iteration hyperchaotic map generates the second discrete series
By second discrete seriesSecond pseudo-random sequence is obtained by the following formula (6) combination
<mrow>
<mtable>
<mtr>
<mtd>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>+</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>+</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>3</mn>
</msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>+</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>4</mn>
</msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
<mo>,</mo>
<mn>...</mn>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>6</mn>
<mo>)</mo>
</mrow>
</mrow>
By second pseudo-random sequencePreceding N2A pseudo-random sequence is cast out, order
And
Respectively willIt is ranked up by ascending order, the sequence of the original subscript value after sequence is saved as to row respectively and is put
Disorderly vectorWith row scramble vector
7. such as claim 1 to 6 any one of them method, which is characterized in that the scramble vector includes line shuffle vector sum
Row scramble vector, carrying out scrambling encryption to plaintext image using scramble vector includes：Plaintext is schemed using the line shuffle vector
As carrying out line shuffle processing；And using the row scramble vector to through line shuffle treated image into ranks disorder processing.
8. the method for claim 7, it is characterised in that：
Carrying out DNA encoding to the chaos sequence includes：The chaos sequence is changed into the first binary sequence；And by institute
It states the first binary sequence and carries out DNA encoding by the first mapping relations of predetermined DNA encoding rule；
Carrying out DNA encoding to the scramble image includes：By the scramble image by intended conversion rule be converted into the two or two into
Sequence processed；And second binary sequence is subjected to DNA encoding by the second mapping relations of DNA encoding rule.
9. method as claimed in claim 8, which is characterized in that using first DNA sequence dna to second DNA sequence dna into
Row diffusion encryption includes：
By formula (7) and (8), the first DNA sequence dna R is utilizedeWith predetermined add operation and XOR operation rule to second
DNA sequence dna P 'eOperation is diffused, obtains the 3rd DNA sequence dna C '：
<mrow>
<mtable>
<mtr>
<mtd>
<mrow>
<msubsup>
<mi>C</mi>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
<mo>=</mo>
<msubsup>
<mi>P</mi>
<mrow>
<mi>e</mi>
<mn>1</mn>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>&CirclePlus;</mo>
<msub>
<mi>R</mi>
<mrow>
<mi>e</mi>
<mn>1</mn>
</mrow>
</msub>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>7</mn>
<mo>)</mo>
</mrow>
</mrow>
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msubsup>
<mi>C</mi>
<mi>i</mi>
<mo>&prime;</mo>
</msubsup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>P</mi>
<mrow>
<mi>e</mi>
<mi>i</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>P</mi>
<mrow>
<mi>e</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>)</mo>
</mrow>
<mo>&CirclePlus;</mo>
<msub>
<mi>R</mi>
<mrow>
<mi>e</mi>
<mi>i</mi>
</mrow>
</msub>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>2</mn>
<mo>,</mo>
<mn>3</mn>
<mo>,</mo>
<mo>...</mo>
<mo>,</mo>
<mn>4</mn>
<mi>m</mi>
<mi>n</mi>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>8</mn>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
10. method as claimed in claim 9, which is characterized in that DNA decodings are carried out to the 3rd DNA sequence dna to be included：
DNA decodings are carried out to the DNA sequence dna by the 3rd mapping relations of DNA encoding rule, change into one-dimensional binary system
Sequence；And
The pixel value that sequence processed is converted by the intended conversion rule ciphertext graph picture is carried out by described one-dimensional two.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810031169.1A CN108122188B (en) | 2018-01-12 | 2018-01-12 | Image encryption method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810031169.1A CN108122188B (en) | 2018-01-12 | 2018-01-12 | Image encryption method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108122188A true CN108122188A (en) | 2018-06-05 |
| CN108122188B CN108122188B (en) | 2021-08-31 |
Family
ID=62233029
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810031169.1A Expired - Fee Related CN108122188B (en) | 2018-01-12 | 2018-01-12 | Image encryption method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108122188B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109559269A (en) * | 2018-11-22 | 2019-04-02 | 福建师范大学福清分校 | A kind of method and terminal of image encryption |
| CN110570344A (en) * | 2019-08-27 | 2019-12-13 | 河南大学 | Image encryption method based on random number embedding and DNA dynamic coding |
| CN111835507A (en) * | 2019-04-19 | 2020-10-27 | 国基电子（上海）有限公司 | Asymmetric encryption and decryption method based on gene chip |
| CN112543093A (en) * | 2020-11-27 | 2021-03-23 | 长沙理工大学 | Image encryption method, device and storage medium based on double-entropy source hyperchaotic system |
| CN113763493A (en) * | 2021-09-02 | 2021-12-07 | 国网湖北省电力有限公司检修公司 | Power transmission line image data encryption and decryption method |
| CN113868690A (en) * | 2021-12-02 | 2021-12-31 | 湖南丰汇银佳科技股份有限公司 | Trusted deposit certificate based privacy calculation method and system |
| CN114615091A (en) * | 2022-05-10 | 2022-06-10 | 中国空气动力研究与发展中心计算空气动力研究所 | Industrial time sequence measurement and control data rapid encryption and transmission method |
| CN114915464A (en) * | 2022-05-06 | 2022-08-16 | 长江大学 | Image encryption method and image decryption method based on special matrix operation |
| CN115174036A (en) * | 2022-09-06 | 2022-10-11 | 华信咨询设计研究院有限公司 | Medical insurance data security transmission system and method based on data processing |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103473733A (en) * | 2013-09-12 | 2013-12-25 | 东北林业大学 | Image encryption algorithm based on DNA encoding and chaotic mapping |
| US20140193062A1 (en) * | 2009-07-13 | 2014-07-10 | H. Lee Moffitt Cancer Center And Research Institute, Inc. | Methods and apparatus for diagnosis and/or prognosis of cancer |
| CN105046636A (en) * | 2015-07-13 | 2015-11-11 | 郑州轻工业学院 | Digital image encryption method based on chaotic system and nucleotide sequence database |
| CN106952213A (en) * | 2017-03-16 | 2017-07-14 | 郑州轻工业学院 | New chaotic image encryption method based on bit permutation with dynamic DNA encoding |
| CN107483195A (en) * | 2017-09-08 | 2017-12-15 | 哈尔滨工业大学深圳研究生院 | Safe mutual authentication and key agreement protocol under environment of internet of things |
-
2018
- 2018-01-12 CN CN201810031169.1A patent/CN108122188B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140193062A1 (en) * | 2009-07-13 | 2014-07-10 | H. Lee Moffitt Cancer Center And Research Institute, Inc. | Methods and apparatus for diagnosis and/or prognosis of cancer |
| CN103473733A (en) * | 2013-09-12 | 2013-12-25 | 东北林业大学 | Image encryption algorithm based on DNA encoding and chaotic mapping |
| CN105046636A (en) * | 2015-07-13 | 2015-11-11 | 郑州轻工业学院 | Digital image encryption method based on chaotic system and nucleotide sequence database |
| CN106952213A (en) * | 2017-03-16 | 2017-07-14 | 郑州轻工业学院 | New chaotic image encryption method based on bit permutation with dynamic DNA encoding |
| CN107483195A (en) * | 2017-09-08 | 2017-12-15 | 哈尔滨工业大学深圳研究生院 | Safe mutual authentication and key agreement protocol under environment of internet of things |
Non-Patent Citations (3)
| Title |
|---|
| KUN ZHAN等: "Cross-utilizing hyperchaotic and DNA sequences for image encryption", 《JOURNAL OF ELECTRONIC IMAGING》 * |
| 朱从旭等: "基于超混沌系统伪随机序列的图像加密算法", 《华中科技大学学报（自然科 学版）》 * |
| 李红凯: "基于混沌理论和DNA序列编码的图像加密算法研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109559269A (en) * | 2018-11-22 | 2019-04-02 | 福建师范大学福清分校 | A kind of method and terminal of image encryption |
| CN109559269B (en) * | 2018-11-22 | 2022-05-03 | 福建师范大学福清分校 | Image encryption method and terminal |
| CN111835507A (en) * | 2019-04-19 | 2020-10-27 | 国基电子（上海）有限公司 | Asymmetric encryption and decryption method based on gene chip |
| US11631344B2 (en) | 2019-04-19 | 2023-04-18 | Ambit Microsystems (Shanghai) Ltd. | Encryption and decryption method based on gene chip |
| CN111835507B (en) * | 2019-04-19 | 2023-04-25 | 富联国基(上海)电子有限公司 | Asymmetric encryption and decryption method based on gene chip |
| CN110570344A (en) * | 2019-08-27 | 2019-12-13 | 河南大学 | Image encryption method based on random number embedding and DNA dynamic coding |
| CN110570344B (en) * | 2019-08-27 | 2022-09-20 | 河南大学 | Image encryption method based on random number embedding and DNA dynamic coding |
| CN112543093A (en) * | 2020-11-27 | 2021-03-23 | 长沙理工大学 | Image encryption method, device and storage medium based on double-entropy source hyperchaotic system |
| CN112543093B (en) * | 2020-11-27 | 2022-06-10 | 长沙理工大学 | Image encryption method, device and storage medium based on double-entropy source hyperchaotic system |
| CN113763493B (en) * | 2021-09-02 | 2023-08-04 | 国网湖北省电力有限公司检修公司 | Encryption and decryption method for image data of power transmission line |
| CN113763493A (en) * | 2021-09-02 | 2021-12-07 | 国网湖北省电力有限公司检修公司 | Power transmission line image data encryption and decryption method |
| CN113868690A (en) * | 2021-12-02 | 2021-12-31 | 湖南丰汇银佳科技股份有限公司 | Trusted deposit certificate based privacy calculation method and system |
| CN114915464A (en) * | 2022-05-06 | 2022-08-16 | 长江大学 | Image encryption method and image decryption method based on special matrix operation |
| CN114615091A (en) * | 2022-05-10 | 2022-06-10 | 中国空气动力研究与发展中心计算空气动力研究所 | Industrial time sequence measurement and control data rapid encryption and transmission method |
| CN114615091B (en) * | 2022-05-10 | 2022-07-22 | 中国空气动力研究与发展中心计算空气动力研究所 | Industrial time sequence measurement and control data rapid encryption and transmission method |
| CN115174036B (en) * | 2022-09-06 | 2023-01-10 | 华信咨询设计研究院有限公司 | Medical insurance data safety transmission system and method based on data processing |
| CN115174036A (en) * | 2022-09-06 | 2022-10-11 | 华信咨询设计研究院有限公司 | Medical insurance data security transmission system and method based on data processing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108122188B (en) | 2021-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108122188A (en) | A kind of image encryption method | |
| Essaid et al. | Image encryption scheme based on a new secure variant of Hill cipher and 1D chaotic maps | |
| François et al. | A new image encryption scheme based on a chaotic function | |
| Abraham et al. | Secure image encryption algorithms: A review | |
| CN110086601A (en) | Based on the associated Josephus traversing of pixel value and hyperchaotic system image encryption method | |
| Singh et al. | Image encryption and analysis using dynamic AES | |
| Bashir et al. | A novel gray scale image encryption scheme based on pixels’ swapping operations | |
| Zhang et al. | A block compressive sensing based scalable encryption framework for protecting significant image regions | |
| Liu et al. | Cryptanalysis and enhancement of an image encryption scheme based on bit-plane extraction and multiple chaotic maps | |
| Acharya et al. | Image encryption by novel cryptosystem using matrix transformation | |
| Panwar et al. | Cryptanalysis and improvement of a color image encryption scheme based on DNA sequences and multiple 1D chaotic maps | |
| Wu et al. | Security analysis and improvement on an image encryption algorithm using Chebyshev generator | |
| Ye | A novel image encryption scheme based on generalized multi-sawtooth maps | |
| Alabaichi | Color image encryption using 3D chaotic map with AES key dependent S-Box | |
| Sari et al. | Beaufort cipher algorithm analysis based on the power lock-Blum Blum Shub in securing data | |
| Ramírez-Torres et al. | Image encryption with an improved cryptosystem based on a matrix approach | |
| Dash et al. | An efficient Intra-Inter pixel encryption scheme to secure healthcare images for an IoT environment | |
| CN116886270B (en) | Three-band encryption method based on national encryption algorithm and double-chaotic system | |
| Patro et al. | Novel data encryption scheme using DNA computing | |
| Pal et al. | A novel image encryption technique with four stage bit-interspersing and a 4D-hyperchaotic system | |
| Mohammed et al. | Secure image encryption scheme using chaotic maps and rc4 algorithm | |
| Mehmood et al. | A time-efficient and noise-resistant cryptosystem based on discrete wavelet transform and chaos theory: An application in image encryption | |
| Tomer et al. | Review on different chaotic based image encryption techniques | |
| Fu et al. | A novel parallel image encryption scheme using chaos | |
| Janardhanan et al. | Bogdanov map-based permuted double 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210831 Termination date: 20220112 |