CN116567160A - Wavelet fusion multi-image encryption method based on improved Lorentz chaos and New Joseph - Google Patents
Wavelet fusion multi-image encryption method based on improved Lorentz chaos and New Joseph Download PDFInfo
- Publication number
- CN116567160A CN116567160A CN202310518830.2A CN202310518830A CN116567160A CN 116567160 A CN116567160 A CN 116567160A CN 202310518830 A CN202310518830 A CN 202310518830A CN 116567160 A CN116567160 A CN 116567160A
- Authority
- CN
- China
- Prior art keywords
- image
- matrix
- scrambling
- fusion
- frequency
- 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.)
- Pending
Links
- 230000004927 fusion Effects 0.000 title claims abstract description 49
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000009792 diffusion process Methods 0.000 claims abstract description 45
- 239000011159 matrix material Substances 0.000 claims description 63
- 230000000739 chaotic effect Effects 0.000 claims description 36
- 230000003068 static effect Effects 0.000 claims description 8
- 238000000354 decomposition reaction Methods 0.000 claims description 7
- 238000013507 mapping Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 5
- 230000009466 transformation Effects 0.000 claims description 5
- 238000012360 testing method Methods 0.000 claims description 4
- 241000588653 Neisseria Species 0.000 claims description 3
- 238000007500 overflow downdraw method Methods 0.000 abstract description 3
- ZAKOWWREFLAJOT-CEFNRUSXSA-N D-alpha-tocopherylacetate Chemical compound CC(=O)OC1=C(C)C(C)=C2O[C@@](CCC[C@H](C)CCC[C@H](C)CCCC(C)C)(C)CCC2=C1C ZAKOWWREFLAJOT-CEFNRUSXSA-N 0.000 description 9
- 230000006872 improvement Effects 0.000 description 6
- 230000007547 defect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 241001212279 Neisseriales Species 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 102100040428 Chitobiosyldiphosphodolichol beta-mannosyltransferase Human genes 0.000 description 1
- 101000891557 Homo sapiens Chitobiosyldiphosphodolichol beta-mannosyltransferase Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005291 chaos (dynamical) Methods 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
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
- H04N1/448—Rendering the image unintelligible, e.g. scrambling
- H04N1/4486—Rendering the image unintelligible, e.g. scrambling using digital data encryption
-
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/065—Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
- H04L9/0656—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher
- H04L9/0662—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher with particular pseudorandom sequence generator
-
- 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
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/08—Randomization, e.g. dummy operations or using noise
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Multimedia (AREA)
- Complex Calculations (AREA)
Abstract
The invention discloses a wavelet fusion multi-image encryption method based on improved Lorentz chaos and new Joseph, which is characterized in that the same user encryption key and decryption key are set, and the user encryption key or the decryption key both comprise an initial value, parameters, iteration times and user control parameters of an improved Lorentz chaos system. The invention provides two wavelet multiple image fusion methods, improves the classical Joseph traversal method, adopts a mode of combining an internal pointer and an external plaintext related pointer to carry out double-pointer scrambling, not only improves scrambling efficiency, but also effectively resists attack of selected plaintext, and provides two scrambling diffusion algorithms aiming at the characteristics of low-frequency and high-frequency information occupation of fusion images, thereby effectively improving image encryption efficiency while ensuring the security of multiple image encryption algorithms.
Description
Technical Field
The invention belongs to the technical field of multi-image encryption, and particularly relates to a wavelet fusion multi-image encryption method based on improved Lorentz chaos and New Joseph.
Background
With the development of the current age technology level, the living aspects of people are more and more informationized. As an important carrier for information transmission, digital images have become an indispensable part of our lives, and are convenient to transmit and wide in application field. But is extremely vulnerable to illegal interception, destruction and tampering when transmitting a large amount of image data on the internet, so that the encryption of the image data is an effective protection method.
To improve the defects of the traditional algorithm, the scholars integrate the chaos theory with the image encryption technology. Compared with the traditional algorithm, the chaotic encryption algorithm has more excellent cryptographic performance, and can effectively protect the safety of image data. Along with the endless chaotic image encryption algorithm, corresponding attack and cracking means are also rapidly developed, and a plurality of relatively backward low-dimensional chaotic systems are cracked due to the defects of single structure, low randomness and the like, so researchers start to improve the low-dimensional chaotic systems in order to solve the problems of small parameter range, poor chaotic characteristics and the like of the low-dimensional chaotic systems.
With the massive transmission of network information, single image encryption cannot meet the security and efficiency requirements in practical applications. The multi-image encryption can encrypt two or more images at the same time under the same computational complexity, so that the effectiveness of image encryption is improved, and most of the current multi-image encryption algorithms have three problems, namely weak security, limited encryption capability or low encryption efficiency, and in this case, a brand-new encryption algorithm is needed to ensure the improvement of encryption security, encryption capability and encryption efficiency.
Disclosure of Invention
Based on the defects of the prior art, the technical problem solved by the invention is to provide a wavelet fusion multi-image encryption method based on improved Lorentz chaos and Neisser, design two wavelet multi-image fusion methods, provide two image scrambling and diffusion algorithms according to the characteristics of fusion images, improve the classical Joisser traversal method, and perform double-pointer scrambling in a mode of combining an internal pointer with an external plaintext related pointer, thereby improving scrambling efficiency and effectively resisting attack of selecting plaintext.
In order to solve the technical problems, the invention is realized by the following technical scheme: the invention provides a wavelet fusion multi-image encryption method based on improved Lorentz chaos and Neisseria, which comprises the following steps:
s1, selecting four plaintext test images P1, P2, P3 and P4 with the size of MxN;
s2, carrying out wavelet decomposition on the picture, and carrying out wavelet fusion on low-frequency and high-frequency components;
s3, iterating the Lorentz chaotic system d by taking a, b and c in the user encryption key as initial values of the three-dimensional chaotic system 0 Three lengths of MXN+d were obtained 00 Is a chaotic sequence X1, Y1, Z1 of (A);
s4, discarding d before chaotic sequence 00 Obtaining a pseudo-random sequence K with length of MxN through matrix transformation according to the iteration result X1 ，K Y1 ，K Z1 ；
S5, scrambling the low-frequency fusion image in the step S2 by using an improved Joseph traversal function;
s6, carrying out dynamic index scrambling on the high-frequency fusion images generated by different schemes in the step S2;
s7, using inter-blocks for the low-frequency fusion image, and performing pointer selection diffusion in the blocks;
s8, carrying out static diffusion on the high-frequency fusion image generated in the step S6;
s9, decrypting the secret key of the user, and obtaining a decryption pseudo-random sequence K by using the method of the step S3 X11 ，K Y11 ，K Z11 ；
S10, performing static back diffusion operation on the high-frequency fusion images with different schemes obtained in the step S8, and then performing index back scrambling;
s11, performing inter-block pointer back diffusion on the ciphertext image obtained in the step S7;
s12, performing improved Joseph pointer function inverse scrambling on the low-frequency matrix obtained in the step S11;
s13, re-fusion is carried out on the low-frequency matrix and the high-frequency matrix based on different schemes.
Further, in step S5, the scrambling procedure is as follows:
s51, for the sequence K generated in the step S4 X1 Performing operation to obtain a start pointer;
s52, calculating the information entropy of the known image to obtain a picture exclusive information entropy pointer1;
s53, calculating the sequence Y1 generated in the step S4 to obtain a start pointer2;
s54, creating a matrix to store the removed pixel positions, marking the corresponding positions as 1, building a one-to-one mapping relation between the picture and the matrix, traversing from a start position, and storing the pixel values to be extracted in the matrix from left to right and from top to bottom; after accessing the pointer2, the start pointer position is updated, and the traversing operation is continuously executed; if the position of the traversed element is in the matrix, skipping the element, and traversing until the matrix is all one; scrambling is completed, and the scrambled image is recorded.
Optionally, in step S7, the diffusion process is as follows:
s71, respectively dividing the scrambled image and the secret key into 16 blocks, and performing exclusive OR operation on each block of scrambled image to generate a diffusion pointer set;
s72, performing exclusive OR operation on each scrambling image block and the next block of the corresponding scrambling vector table to generate a diffusion matrix;
s73, combining the 16 image blocks subjected to inter-block diffusion into a complete ciphertext image;
and S74, performing further dynamic diffusion on each pixel in the ciphertext image to obtain a final ciphertext image.
By the method, the wavelet fusion multi-image encryption method based on improved Lorentz chaos and new Joseph has the following beneficial effects by means of a network evolution game:
1. the invention provides a wavelet fusion multi-image encryption scheme based on improved Lorentz chaos and new Joseph, which is characterized in that the same user encryption key and decryption key are set, and the user encryption key or the decryption key both comprise an initial value, parameters, iteration times and user control parameters of an improved Lorentz chaos system.
2. The invention adds a new nonlinear adjustment item and control parameters to the traditional Lorentz chaotic system, so that the pseudo random number generated by the traditional Lorentz chaotic system is more unpredictable, the Lorentz chaotic system is improved, and the improved chaotic system has a wider chaotic parameter range and better chaotic characteristic.
3. The two wavelet multi-image fusion methods are provided, the classical Josephson traversal method is improved, double-pointer scrambling is performed by adopting a mode of combining an internal pointer and an external plaintext related pointer, so that scrambling efficiency is improved, and attack of selecting plaintext can be effectively resisted; two scrambling and diffusion algorithms are provided aiming at the characteristic of the low-frequency-high-frequency information occupation of the fusion image, so that the image encryption efficiency can be effectively improved while the safety of the multi-image encryption algorithm is ensured.
The foregoing description is only an overview of the present invention, and is intended to be implemented in accordance with the teachings of the present invention, as well as to provide a more concise and understandable description of the foregoing and other objects, features and advantages of the present invention, as well as the following detailed description of the preferred embodiments, when read in conjunction with the accompanying drawings.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings which are required in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of an encryption process in a wavelet fusion multi-image encryption and decryption method for improving Lorentz chaos and Neisseria according to the invention;
FIG. 2 is a flow chart of a decryption process in the improved Lorentz chaos and New Joseph wavelet fusion multiple image encryption and decryption method of the present invention;
FIG. 3 is a schematic diagram of a Neisserial model in the improved Lorentz chaos and Neisserial wavelet fusion multiple image encryption and decryption method of the present invention;
FIG. 4 is a schematic diagram of a block pointer diffusion model in the improved Lorentz chaos and New Joseph wavelet fusion multiple image encryption and decryption method of the present invention;
fig. 5 is a graph of wavelet processing effects in the improved lorentz chaos and new joseph wavelet fusion multi-image encryption and decryption method of the present invention: wherein (a) - (d) are original images; (e) - (h) are images of a multi-scale one-dimensional wavelet decomposition; (i) - (l) are pre-processed images of scheme a; (m) - (q) are pre-processed images of scheme B;
fig. 6 is a diagram showing the effect of encrypting and decrypting by the improved lorentz chaos and new joseph wavelet fusion multi-image encrypting and decrypting method: wherein (a) - (d) are original images; (e) - (h) are scheme a encrypted images; the left side (n) - (q) of the image are the decrypted image on the left side of scheme a; (i) - (m) are scheme B encrypted images; the right side (n) - (q) of the image is the image decrypted by the scheme B;
fig. 7 is a histogram of scheme a of the wavelet fusion multiple image encryption/decryption method of the present invention for improving lorentz chaos and new joseph: wherein (a) - (d) are four plaintext histograms; (e) - (h) reconstructing a histogram for four wavelets; (i) - (l) are four encrypted ciphertext histograms; (m) - (p) are four decrypted picture histograms;
fig. 8 is a histogram of scheme B of the wavelet fusion multiple image encryption/decryption method of the present invention for improving lorentz chaos and new joseph: wherein (a) - (d) are four plaintext histograms; (e) - (i) reconstructing a histogram for five wavelets; (j) - (n) are five encrypted ciphertext histograms; (o) - (r) are four decrypted picture histograms;
fig. 9 is a comparison of the lorentz chaotic system before improvement and the lorentz chaotic system after improvement according to the present invention: wherein (a) and (b) are the Liapunov analysis charts before and after improvement, and (c) and (d) are the bifurcation charts before and after improvement.
Detailed Description
The following describes in detail the embodiments of the wavelet fusion multi-image encryption method based on improved lorentz chaos and new joseph according to the present invention with reference to the accompanying drawings.
As shown in fig. 1 to 9, the wavelet fusion multi-image encryption method based on improved lorentz chaos and new joseph of the present invention comprises the steps of:
s1, selecting four plaintext test images P1, P2, P3 and P4 with the size of MxN.
S2, performing wavelet decomposition on the picture, and performing wavelet fusion on the low-frequency component and the high-frequency component.
S3, taking a, b and c in the user encryption key as initial values of the three-dimensional chaotic system, and iteratingThe Lorentz chaotic system d 0 Three lengths of MXN+d were obtained 00 Is a chaotic sequence X1, Y1, Z1 of the sequence.
S4, discarding d before chaotic sequence 00 Obtaining a pseudo-random sequence K with length of MxN through matrix transformation according to the iteration result X1 ，K Y1 ，K Z1 。
S5, scrambling the low-frequency fusion image in the step S2 by using an improved Joseph traversal function, wherein the scrambling process is as follows:
s51, for the sequence K generated in the step S4 X1 Performing operation to obtain a start pointer;
s52, calculating the information entropy of the known image to obtain a picture exclusive information entropy pointer1;
s53, calculating the sequence Y1 generated in the step S4 to obtain a start pointer2;
s54, creating a matrix to store the removed pixel positions, marking the corresponding positions as 1, building a one-to-one mapping relation between the picture and the matrix, traversing from a start position, and storing the pixel values to be extracted in the matrix from left to right and from top to bottom; after accessing pointer2, the start pointer position is updated, and the traversal operation is continued. If the position of the traversed element is in the matrix, skipping the element, and traversing until the matrix is all one; scrambling is completed, and the scrambled image is recorded.
S6, carrying out dynamic index scrambling on the high-frequency fusion images generated by different schemes in the step S2.
S7, using inter-block pointer selection diffusion for the low-frequency fusion image, wherein the diffusion process is as follows:
s71, respectively dividing the scrambled image and the secret key into 16 blocks, and performing exclusive OR operation on each block of scrambled image to generate a diffusion pointer set;
s72, performing exclusive OR operation on each scrambling image block and the next block of the corresponding scrambling vector table to generate a diffusion matrix;
s73, combining the 16 image blocks subjected to inter-block diffusion into a complete ciphertext image;
and S74, performing further dynamic diffusion on each pixel in the ciphertext image to obtain a final ciphertext image.
S8, performing static diffusion on the high-frequency fusion image generated in the step S6.
S9, decrypting the secret key of the user, and obtaining a decryption pseudo-random sequence K by using the method of the step S3 X11 ，K Y11 ，K Z11 。
S10, performing static back diffusion operation on the high-frequency fusion images with different schemes obtained in the step S8, and then performing index back scrambling.
S11, performing inter-block pointer back diffusion on the ciphertext image obtained in the step S7.
S12, performing improved Joseph pointer function inverse scrambling on the low-frequency matrix obtained in the step S11.
S13, re-fusion is carried out on the low-frequency matrix and the high-frequency matrix based on different schemes.
Examples
The invention provides an improved Lorentz chaos and new Joseph wavelet fusion multi-image encryption scheme, which is characterized in that the same user encryption key and decryption key are set, the user encryption key or the decryption key is an improved initial value, parameter and iteration number of the Lorentz chaos system, and the user control parameter, and the encryption process of the method is realized by the following steps:
step one, selecting four plaintext test images P1, P2, P3 and P4 with the size of 256 multiplied by 256;
performing wavelet decomposition on the four pictures, and performing wavelet fusion on the low-frequency component and the high-frequency component, wherein the processing steps are as follows:
(1) P1, P2, P3 and P4 are decomposed into a layer of wavelets using wavelet transforms.
W Pi ＝wavedec(Pi),i＝1,2,3,4 (1)
Wherein the function wavedec () is used for multi-scale one-dimensional wavelet decomposition to obtain four image components. (2) Extracting low-frequency component and high-frequency component Ca of the first layer in wavelet decomposition structure of plaintext images P1, P2, P3 and P4, respectively n ,Ch n ,Cv n ,Cd n ,n∈[1，4]Wherein Ca is 1 ,Ca 2 ,Ca 3 ,Ca 4 The first layer of decomposed low frequency information is preserved.
(3) The low-frequency component Ca in the four images 1 ,Ca 2 ,Ca 3 ,Ca 4 By inverse wavelet transform, fuse to Con ca 。
Con ca ＝wrcoef([Ca 1 ,Ca 2 ；Ca 3 ,Ca 4 ]) (2)
Wherein the function wrcoef () is used for image component reconstruction.
(4) The wavelet fusion is carried out on the high-frequency component by adopting two different schemes, and the steps are as follows:
based on scheme a: and carrying out corresponding grouping fusion on the high-frequency components of the four pictures:
a first group: will ch 1 ,ch 2 ,ch 3 ,ch 4 By inverse wavelet transform, fuse to Con ch ；
Second group: will cv 1 ,cv 2 ；cv 3 ,cv 4 By inverse wavelet transform, fuse to Con cv ；
Third group: will cd 1 ,cd 2 ；cd 3 ,cd 4 By inverse wavelet transform, fuse to Con cd 。
Based on scheme B:
randomly generating four random matrices R of 128 x 128 size 1, R 2, R 3, R 4 For the low frequency component Ca of each picture n Replacing, fusing the high-frequency components of the image and the random matrix through wavelet inverse transformation to obtain R e1， R e2， R e3， R e4 。
Where function rand () is used to produce a 128 x 128 matrix evenly distributed between (0, 1).
Step three, iterating the Lorentz chaotic system d by taking a, b and c in the user encryption key as initial values of the three-dimensional chaotic system 0 Three lengths of 256×256+d were obtained 00 In this embodiment of the chaotic sequence of (a): a=0.1, b=280,x＝0.1，y＝0.1，z＝0.3，t＝2000，d 0 ＝200000，d 00 ＝20000。
wherein x, y, z are state variables of the chaotic system, and a, b and c are system parameters; the constant term in the system is e 7 The method comprises the steps of carrying out a first treatment on the surface of the t is the transition state length of the classical lorentz chaotic system, the modified lorentz chaotic system, and the value range of b is (b)>0)。
Step four, discarding 20000 iteration results before the chaotic sequence, and obtaining a pseudorandom sequence K with the length of MxN through matrix transformation X1 ，K Y1 ，K Z1 ：
Wherein floor () rounds down the argument and mod () leaves the argument.
Step five, due to the matrix Con ca Important picture pixel information is stored, and safer and more complex scrambling algorithms are needed. The use of classical joseph traversal scrambles data with a certain regularity, in order to avoid this drawback, the original joseph pointer function was modified. The improved function realizes one-to-one mapping of the plaintext image and the secret key, improves the efficiency, and ensures the security of the scrambled pixels. The improved joseph pointer function is:
joseph_traverse(picture,start,pointer1,pointer2) (8)
wherein picture is the matrix Con obtained in the second step ca Start is the initial position of traversal, pointer1 is the entropy pointer, and pointer2 is the chaotic pointer.
The specific improvement and use steps are as follows:
(1) The chaos sequence K generated in the step four is processed X1 Substituting formula 9 to obtain a random starting point;
where n=65536, p=140, β=985.12345678, round () means rounded to the specified number of bits.
(2) Con generated in step three ca Substituting formula 10 to calculate information entropy H α Handle H α Substituting formula 11 to obtain a picture exclusive information entropy pointer1;
wherein p (m) i ) Represents m i Is a probability of (2).
pointer1(α)＝mod(H α (m),200) (11)
Where δ=200, represents a user control parameter.
(3) Substituting the chaotic sequence Y1 generated in the step four into a formula 12 to obtain a chaotic pointer2;
pointer2＝mod(floor(Y1×10 16 ),201) (12)
where θ=201 denotes a user control parameter.
(4) Creating a matrix Tag mat To store the removed pixel position and mark the corresponding position as 1 to establish a picture Con ca And matrix Tag mat One-to-one mapping relation, traversing from the initial bit, storing the pixel value to be extracted in the matrix Tag from left to right and from top to bottom mat . After accessing pointer2, the start pointer position is updated and execution is continuedThe row traverses operations. If the position of the traversal element is in Tag mat And skipping the element, traversing until the Tag matrix is all 1. Scrambling is completed and the scrambled image Src is recorded img 。
Step six, the matrix Con generated by the scheme A in the step two ch ，Con cv ，Con cd And matrix R generated by scheme B in step two e1 ，R e2 ，R e3 ，R e4 For storing picture position information, we use a more efficient index scrambling algorithm. Dynamic index scrambling of scheme A and scheme B to obtain Src ch ,Src cv ,Src cd And Src (Src) re1 ,Src re2 ,Src re3 ,Src re4 The scrambling rule is as follows:
where index () is an index function.
Step seven, because of the matrix Src after scrambling img Storing important picture pixel information, we need to make safer and more complex diffusion algorithm. Here, a pointer diffusion algorithm based on block images is adopted to selectively diffuse pointers among blocks and in blocks. The method comprises the following specific steps:
selecting diffusion based on inter-block pointers:
(1) Scrambling the image Src img And key K Z1 Respectively divided into 16 blocks, and marked as Eblc u ,K u ,u∈[1,16]The method comprises the steps of carrying out a first treatment on the surface of the Scrambling image Eblc using equation 15 and equation 16 u And performing operation to generate a diffusion pointer set G.
G(m)＝mod((sum p(m) ×π+985.12345678)×10 14 ,16) (16)
Where i, j is an index variable and epsilon= 985.12345678 denotes a user control parameter.
(2) Each image block Eblc using equation 17 u Performing exclusive OR operation with the next block of the corresponding scrambling vector table to generate a diffusion matrix EN;
selecting diffusion based on intra-block pointers:
(1) The 16 image blocks after inter-block diffusion are combined into a complete ciphertext image Z.
(2) Further dynamic diffusion of each pixel within matrix Z to obtain the final ciphertext image ECon is performed using equation 19 ca 。
Step eight, using the formula 20 and the formula 21 to respectively generate the high-frequency fusion image { Src }, which is generated in the step six ch ,Src cv ,Src cd }{Src re1 ,Src re2 ,Src re3 ,Src re4 Performing static diffusion operation, and obtaining the final encryption result of { ECon } ch ,ECon cv ,ECon cd And { ERe } and 1 ,ERe 2 ,ERe 3 ,ERe 4 }. is the final high frequency ciphertext image.
Scheme A:
scheme B:
where bitxor () is an exclusive or function and reshpe () is a two-dimensional matrix that rearranges matrix a into m×n.
In this embodiment, the method further includes a decryption step, specifically:
step nine, step a=0.1, step b=280,t＝2000，x＝0.1，y＝0.1，z＝0.3，β＝985.12345678，δ＝200，θ＝201，H α ＝6.6364，
ε＝985.12345678，H α using p=140 as user decryption key, obtaining decryption pseudo-random sequence, K in the method of step three X11 ，K Y11 ，K Z11 。
Tenth, using the formula 22 and the formula 23 to respectively obtain the high-frequency fusion image { ECon } obtained in the step eight ch ,ECon cv ,ECon cd And { ERe } and 1 ,ERe 2 ,ERe 3 ,ERe 4 static back diffusion operation is carried out to obtain { Src } ch1 ,Src cv1 ,Src cd1 Sum { Src } re11 ,Src re21 ,Src re31 ,Src re41 Then through formulas 24 and 25, index inverse scrambling is carried out to obtain the final inverse encryption result as high frequency component
{Con ch1 ，Con cv1 ，Con cd1 Sum { Re } 11 ，Re 21 ，Re 31 ，Re 41 }。
Scheme A:
scheme B:
step eleven, use equation 26 to ECon ca Performing intra-block pointer back diffusion to obtain ECon ca1 Then obtaining the low-frequency matrix Eblc after back diffusion through the user parameter pointer G and the formula 37 u1 。
Step twelve, performing inverse diffusion on the low-frequency matrix Eblc u1 Improved Joseph pointer function scrambling was performed. Defining a matrix Tag of all zeros mat1 . Through K delivered to user X1 ，K Y1 And information entropy H α Starting 1, pointer11, pointer21 are obtained by using the formulas 28, 29 and 30, and the low frequency matrix Con before scrambling is obtained by using the formula 31 ca1 。
pointer11(α)＝mod(H α (m),200) (29)
pointer21＝mod(floor(Y1×10 16 ),201) (30)
joseph_traverse(picture,start1,pointer11,pointer21) (31)
Where picture represents the low frequency matrix Eblc after back diffusion u1 。
Thirteen steps, for low frequency matrix Con ca1 And high frequency matrix { Con ] ch1 ，Con cv1 ，Con cd1 Sum { Re } 11 ，Re 21 ，Re 31 ，Re 41 Re-fusion was performed, based on different schemes, as follows:
(1) Low frequency matrix Con ca1 Decompose into according to equation 32Four-block matrix ca 11 ,ca 21 ,ca 31, ca 41 。
[ca 11 ,ca 21 ,ca 31, ca 41 ]＝wavedec(Con ca1 ) (32)
(2) Based on scheme a: high frequency matrix set { Con } ch1 ，Con cv1 ，Con cd1 Each high frequency matrix is decomposed into four matrices [ ch ] according to equation 33 11 ,ch 21 ；ch 31 ,ch 41 ]，
[cv 11 ,cv 21 ；cv 31 ,cv 41 ]，[cd 11 ,cd 21 ；cd 31 ,cd 41 ]. The low frequency matrix is wavelet fused with the corresponding high frequency matrix according to equation 34 to obtain four pictures P1, P2, P3 and P4 before encryption.
(3) Based on scheme B: high frequency matrix set { Re 11 ，Re 21 ，Re 31 ，Re 41 Each high frequency matrix is decomposed into four matrices { R } according to equation 35 11 ,ch 11 ；cv 11 ,cd 11 }，
{R 2 ,ch 21 ；cv 21 ,cd 21 }，{R 31 ,ch 31 ；cv 31 ,cd 31 }，{R 41 ,ch 41 ；cv 41 ,cd 41 }. The low frequency matrix ca is used according to equation 36 11 ,ca 21 ,ca 31, ca 41 Respectively cover R 11 ,R 21 ,R 31 ,R 41 And carrying out wavelet fusion on the new high-frequency matrix group to obtain four pictures P1, P2, P3 and P4 before encryption.
Finally, it should be noted that: while the invention has been described with respect to the preferred embodiments, it will be understood that the invention is not limited thereto, but is capable of modification and variation without departing from the spirit of the invention, as will be apparent to those skilled in the art.
Claims (3)
1. The wavelet fusion multi-image encryption method based on improved Lorentz chaos and Neisseria is characterized by comprising the following steps:
s1, selecting four plaintext test images P1, P2, P3 and P4 with the size of MxN;
s2, carrying out wavelet decomposition on the picture, and carrying out wavelet fusion on low-frequency and high-frequency components;
s3, iterating the Lorentz chaotic system d by taking a, b and c in the user encryption key as initial values of the three-dimensional chaotic system 0 Three lengths of MXN+d were obtained 00 Is a chaotic sequence X1, Y1, Z1 of (A);
s4, discarding d before chaotic sequence 00 Obtaining a pseudo-random sequence K with length of MxN through matrix transformation according to the iteration result X1 ，K Y1 ，K Z1 ；
S5, scrambling the low-frequency fusion image in the S2 by using an improved Joseph traversal function;
s6, carrying out dynamic index scrambling on the high-frequency fusion images generated by different schemes in the step S2;
s7, using inter-blocks for the low-frequency fusion image, and performing pointer selection diffusion in the blocks;
s8, carrying out static diffusion on the high-frequency fusion image generated in the step S6;
s9, decrypting the secret key of the user, and obtaining a decryption pseudo-random sequence K by using the method of the step S3 X11 ，K Y11 ，K Z11 ；
S10, performing static back diffusion operation on the high-frequency fusion images with different schemes obtained in the step S8, and then performing index back scrambling;
s11, performing inter-block pointer back diffusion on the ciphertext image obtained in the step S7;
s12, performing improved Joseph pointer function inverse scrambling on the low-frequency matrix obtained in the step S11;
s13, re-fusion is carried out on the low-frequency matrix and the high-frequency matrix based on different schemes.
2. The improved lorentz chaos and new joseph based wavelet fusion multi-image encryption method of claim 1 wherein in step S5 the scrambling process is as follows:
s51, for the sequence K generated in the step S4 X1 Performing operation to obtain a start pointer;
s52, calculating the information entropy of the known image to obtain a picture exclusive information entropy pointer1;
s53, calculating the sequence Y1 generated in the step S4 to obtain a start pointer2;
s54, creating a matrix to store the removed pixel positions, marking the corresponding positions as 1, building a one-to-one mapping relation between the picture and the matrix, traversing from a start position, and storing the pixel values to be extracted in the matrix from left to right and from top to bottom; after accessing the pointer2, the start pointer position is updated, and the traversing operation is continuously executed; if the position of the traversed element is in the matrix, skipping the element, and traversing until the matrix is all one; scrambling is completed, and the scrambled image is recorded.
3. The improved lorentz chaos and new joseph based wavelet fusion multi-image encryption method of claim 1 wherein in step S7 the diffusion process is as follows:
s71, respectively dividing the scrambled image and the secret key into 16 blocks, and performing exclusive OR operation on each block of scrambled image to generate a diffusion pointer set;
s72, performing exclusive OR operation on each scrambling image block and the next block of the corresponding scrambling vector table to generate a diffusion matrix;
s73, combining the 16 image blocks subjected to inter-block diffusion into a complete ciphertext image;
and S74, performing further dynamic diffusion on each pixel in the ciphertext image to obtain a final ciphertext image.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310518830.2A CN116567160A (en) | 2023-05-10 | 2023-05-10 | Wavelet fusion multi-image encryption method based on improved Lorentz chaos and New Joseph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310518830.2A CN116567160A (en) | 2023-05-10 | 2023-05-10 | Wavelet fusion multi-image encryption method based on improved Lorentz chaos and New Joseph |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116567160A true CN116567160A (en) | 2023-08-08 |
Family
ID=87495963
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310518830.2A Pending CN116567160A (en) | 2023-05-10 | 2023-05-10 | Wavelet fusion multi-image encryption method based on improved Lorentz chaos and New Joseph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116567160A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117998025A (en) * | 2024-04-07 | 2024-05-07 | 山东青橙数字科技有限公司 | Key information identification image encryption method based on level metering operation |
-
2023
- 2023-05-10 CN CN202310518830.2A patent/CN116567160A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117998025A (en) * | 2024-04-07 | 2024-05-07 | 山东青橙数字科技有限公司 | Key information identification image encryption method based on level metering operation |
| CN117998025B (en) * | 2024-04-07 | 2024-06-11 | 山东青橙数字科技有限公司 | Key information identification image encryption method based on level metering operation |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110086601B (en) | Joseph traversal and hyperchaotic system image encryption method based on pixel value association | |
| 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 | |
| CN112202545B (en) | Image encryption method based on Y-type filling curve and variable-step Joseph traversal | |
| Zhou et al. | Novel multiple color images encryption and decryption scheme based on a bit-level extension algorithm | |
| CN112906043B (en) | Image encryption method based on chaotic mapping and chaotic S-box substitution | |
| CN112311524B (en) | Image encryption method based on new chaotic mapping and compressed sensing | |
| CN115580687B (en) | Multi-image encryption method based on variable parameter hyperchaotic system and S-shaped diffusion | |
| CN110572252A (en) | image encryption and decryption method based on fractional order translation chaotic system | |
| CN116567160A (en) | Wavelet fusion multi-image encryption method based on improved Lorentz chaos and New Joseph | |
| CN111934846A (en) | Multi-chaos Arnold image encryption method based on fractional Fourier transform | |
| Singh et al. | Using GAN-based encryption to secure digital images with reconstruction through customized super resolution network | |
| Li et al. | A joint image compression and encryption scheme based on a novel coupled map lattice system and DNA operations | |
| Jameel et al. | Digital image encryption techniques: Article Review | |
| Mohamed et al. | Improving image encryption using 3d cat map and turing machine | |
| Iqbal et al. | An efficient hybrid encryption model based on deep convolutional neural networks, deoxyribonucleic acid computing and chaotic system | |
| Zhang et al. | Color Image Encryption Based on LSS-Type Coupled Mapped Lattice | |
| Hosseini et al. | A parallel image encryption based on elementary cellular automata using two processors | |
| Liu et al. | Fingerprint image encryption based on chaos and nonlinear dynamic “X” model diffusion | |
| Jagadeesh et al. | A new image scrambling scheme through chaotic permutation and geometric grid based noise induction | |
| Gupta et al. | Image Encryption using Chaotic maps: State of the art | |
| Seyedzadeh et al. | Image encryption scheme based on Choquet fuzzy integral with pseudo-random keystream generator | |
| Menon et al. | Scytale--An Evolutionary Cryptosystem | |
| CN117118591B (en) | Chaotic cryptographic system based on fractal sequencing vector S box | |
| CN115499557B (en) | Arnold mapping and multi-shift mapping function-based delayed chaotic image encryption method |
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 |