CN115766027A - Multi-type image joint encryption method, system and storage medium - Google Patents
Multi-type image joint encryption method, system and storage medium Download PDFInfo
- Publication number
- CN115766027A CN115766027A CN202211372018.5A CN202211372018A CN115766027A CN 115766027 A CN115766027 A CN 115766027A CN 202211372018 A CN202211372018 A CN 202211372018A CN 115766027 A CN115766027 A CN 115766027A
- Authority
- CN
- China
- Prior art keywords
- scrambling
- key
- matrix
- pseudo
- diffusion
- 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
- 238000000034 method Methods 0.000 title claims abstract description 59
- 239000011159 matrix material Substances 0.000 claims abstract description 85
- 238000009792 diffusion process Methods 0.000 claims abstract description 39
- 238000012545 processing Methods 0.000 claims abstract description 25
- 230000000739 chaotic effect Effects 0.000 claims abstract description 20
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 18
- 230000009467 reduction Effects 0.000 claims abstract description 11
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000013507 mapping Methods 0.000 claims description 3
- 230000009466 transformation Effects 0.000 claims description 3
- 125000004122 cyclic group Chemical group 0.000 claims description 2
- 230000000694 effects Effects 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 235000002566 Capsicum Nutrition 0.000 description 1
- 239000006002 Pepper Substances 0.000 description 1
- 235000016761 Piper aduncum Nutrition 0.000 description 1
- 235000017804 Piper guineense Nutrition 0.000 description 1
- 244000203593 Piper nigrum Species 0.000 description 1
- 235000008184 Piper nigrum Nutrition 0.000 description 1
- 238000005291 chaos (dynamical) Methods 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 150000003839 salts Chemical class 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Abstract
The invention provides a multi-type image joint encryption method, a multi-type image joint encryption system and a storage medium. The method comprises the following steps: generating a key through an SHA-512 algorithm, and processing the generated key; substituting the processed key into an improved Chebyshev chaotic system NCCS to generate two pseudo-random sequences for scrambling and diffusion respectively; performing dimension reduction processing on the three-dimensional matrix by adopting a spiral curve, and then sequentially performing index scrambling and one-dimensional Arnold scrambling; and diffusing by adopting a classical modulus-adding and left-shifting method to obtain a ciphertext image. The invention designs a combined encryption method of a remote sensing image, a gray level image and a color image based on a low-dimensional chaotic system, which has no limit on the size and the wave band number of the remote sensing image, solves the problem of combined encryption of various types of images such as the remote sensing image, the gray level image, the color image and the like, and has better encryption effect.
Description
Technical Field
The present invention relates to the field of image encryption technologies, and in particular, to a method, a system, and a storage medium for jointly encrypting multiple types of images.
Background
At present, the common image encryption algorithm is proposed to be endless, a series of common image encryption algorithms based on the chaos theory are highly approved by the industry, the common image encryption schemes such as the application of the fractal sequencing theory in image encryption, the image encryption scheme based on the DNA coding theory, the encryption scheme based on the matrix semitensor product and Boolean network, and the like, and the multiple image encryption schemes are increasingly developed, but the joint encryption scheme for various types of images is not developed at present.
At present, the image encryption field is mostly an encryption method for color images and gray level images, and the implementation is restricted by image types, so that the method has certain limitations.
Disclosure of Invention
According to the technical problems that encryption of remote sensing images with multiple wave bands is provided and the size and the number of the wave bands of the remote sensing images are not limited, a multi-type image joint encryption method, a multi-type image joint encryption system and a storage medium are provided. The invention designs a combined encryption method of a remote sensing image, a gray level image and a color image based on a low-dimensional chaotic system, which has no limit on the size and the wave band number of the remote sensing image, solves the problem of combined encryption of various types of images such as the remote sensing image, the gray level image, the color image and the like, and has better encryption effect.
The technical means adopted by the invention are as follows:
a multi-type image joint encryption method comprises the following steps:
generating a key through an SHA-512 algorithm, and processing the generated key;
substituting the processed key into an improved Chebyshev chaotic system NCCS to generate two pseudo-random sequences for scrambling and diffusion respectively;
performing dimension reduction processing on the three-dimensional matrix by adopting a spiral curve, and then sequentially performing index scrambling and one-dimensional Arnold scrambling;
and diffusing by adopting a classical modulus-adding circulation left shift method to obtain a ciphertext image.
Further, the generating a key through the SHA-512 algorithm and processing the generated key include:
the image P with the MNK size is brought into an SHA-512 algorithm to obtain a group of 128-bit hexadecimal key;
converting hexadecimal key into binary character string key 1 ；
Key the character string 1 Respectively carrying out exclusive or on each two adjacent bits to obtain a group of character strings key2 with the length of 256 bits;
converting the character string key2 into four parts with equal length to obtain four values, namely K 1 ，K 2 ，K 3 ，K 4 ：
In the above formula, K 1 Representing a first partial key, K 2 Representing a second partial key, K 3 Representing a third partial key, K 4 Representing a fourth partial key;
and calculating parameters and initial values required by two sets of NCCS according to the obtained four values, wherein the calculation formula is as follows:
in the above formula,. Mu.denotes a parameter of NCCS,. Mu. 1 Indicating a preferred first value of μ, μ 2 Representing the second value of μ, roundn () representing a rounding function, x 0 Denotes the initial value, x, of NCCS 1 Represents x 0 Preferably a first initial value, x 2 Represents x 0 The second desirable initial value, mod () represents a modulo function.
Further, the step of substituting the processed secret key into the improved Chebyshev chaotic system NCCS to generate two pseudo-random sequences for scrambling and diffusion respectively includes:
the calculated parameters mu = mu required for NCCS 1 And substituting the initial value into NCCS to generate a group of sequences A with the length of M +3MNK, wherein the sequences are divided into four parts A 1 ,A 2 ,A 3 ,A 4 In which the pseudo-random sequence A 1 The length is M, and the method is used for inter-row index scrambling; pseudo-random sequence A 2 The length is MNK, and the MNK is used for in-line index scrambling; pseudo-random sequence A 3 ,A 4 The length is MNK, and the MNK is used for generating parameters of one-dimensional Arnold scrambling;
the calculated NCCS required parameter μ = μ 2 And an initial value x 0 ＝x 2 Substituting into NCCS to generate a group of 2 MNK-long sequences B, and equally dividing the sequences B into two parts B 1 ,B 2 And the length is MN for diffusion.
Further, the performing dimension reduction processing on the three-dimensional matrix by using the spiral curve, and then sequentially performing index scrambling and one-dimensional Arnold scrambling specifically includes:
scanning three-dimensional matrix P side sections one by one from the leftmost side by using a spiral curve to obtain pixel values, wherein each section is used as a two-dimensional matrix P 1 One row of (2), namely, reducing the dimension of the three-dimensional matrix into a two-dimensional matrix with the size of M (NK);
for two-dimensional matrix P 1 According to a pseudo-random sequence A 1 Performing row scrambling once, and converting into one-dimensional matrix P 2 Size 1 × (MNK); according to a pseudo-random sequence A 2 Performing index scrambling once to obtain a one-dimensional matrix P 3 ；
For a one-dimensional matrix P 3 One-dimensional Arnold transformation is carried out to obtain a matrix C after scrambling 0 。
Further, the diffusing is performed by adopting a classical modulo left-shift method to obtain the ciphertext image, and the method specifically includes:
pseudo-random sequence B 1 ,B 2 Decimal numbers with the length of (0, 1) and MNK are mapped to (0, 255) through the following formula to obtain a pseudo-random sequence S 1 ,S 2 ；
S 1 ＝mod(floor(B 1 *2^16),256)
S 2 ＝mod(floor(B 2 *2^16),256)
Converting the original matrix P into a one-dimensional matrix P 0 1MNK in size; scrambled matrix C 0 A size of 1MNK; pseudo-random sequence S 1 ,S 2 All the sizes are 1 × MNK;
according to the original matrix P 0 Pseudo-random sequence S 1 To the matrix C according to the following formula 0 Performing forward diffusion to obtain a matrix C 1 ；
C i (0)＝mod(C i-1 (0)+S i (1)+P i (0),256)＜＜＜LSB 3 (C i-1 (0))
In the above formula, C i-1 (0) Denotes the matrix obtained by diffusion of the (i-1) th order, S i (1) The ith value, P, representing a pseudo-random sequence i Representing the original matrix, LSB, after the i-th diffusion 3 Representing a circular left shift function;
according to the original matrix P 0 Pseudo-random sequence, to the matrix C according to 1 Performing reverse diffusion to obtain a matrix C;
C i (1)＝mod(C i+1 (1)+S i (2)+P i (0),256)＜＜＜LSB 3 (C i+1 (1))
in the above formula, C i+1 (1) Denotes the matrix obtained by diffusion of the (i + 1) th order, S i (2) The ith value, P, representing a pseudo-random sequence i Representing the original matrix after the ith diffusion.
The invention also provides a multi-type image joint encryption system, which comprises:
the key processing module is used for generating a key through an SHA-512 algorithm and processing the generated key;
the chaotic sequence generation module is used for substituting the processed key into an improved Chebyshev chaotic system NCCS to generate two pseudo-random sequences for scrambling and diffusion respectively;
the scrambling module is used for carrying out dimension reduction processing on the three-dimensional matrix by adopting a spiral curve and then sequentially carrying out index scrambling and one-dimensional Arnold scrambling;
and the diffusion module is used for performing diffusion by adopting a classical modulus addition and left shift method to obtain a ciphertext image.
A computer-readable storage medium having a set of computer instructions stored therein; the set of computer instructions, when executed by the processor, implement the multi-type image joint encryption method as described above.
Compared with the prior art, the invention has the following advantages:
1. the multi-type image joint encryption method provided by the invention provides a novel Chebyshev chaotic system on the basis of the traditional Chebyshev chaotic system, so that the time complexity of the algorithm is effectively reduced, and the generated pseudo-random sequence is more uniform and has better performance.
2. The multi-type image joint encryption method provided by the invention encrypts the remote sensing image on the basis of a novel Chebyshev chaotic system, firstly places each wave band of the remote sensing image into different channels to obtain a three-dimensional matrix, successively reads each side surface of the three-dimensional matrix by using a 3-D spiral curve, and places the obtained one-dimensional sequence into a two-dimensional matrix.
3. The multi-type image joint encryption method provided by the invention scrambles one-dimensional sequences once by chaotic mapping, then scrambles the one-dimensional sequences, and diffuses by adopting a circulation left-shift method. The method is suitable for encrypting the images with multiple channels, so that the method can be used for encrypting the remote sensing images and can also be used for jointly encrypting the remote sensing images, the gray level images and the color images.
4. The multi-type image joint encryption method provided by the invention is proved to have good safety through simulation results and performance analysis, and compared with some existing encryption schemes, the method provided by the invention is wider in application range.
Based on the reasons, the method can be widely popularized in the fields of image encryption and the like.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flow chart of the method of the present invention.
FIG. 2 is a schematic diagram of a scrambling process according to the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, shall fall within the protection scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Moreover, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
As shown in fig. 1, the present invention provides a multi-type image joint encryption method, including:
s1, generating a key through an SHA-512 algorithm, and processing the generated key;
s2, substituting the processed key into an improved Chebyshev chaotic system NCCS to generate two pseudo-random sequences for scrambling and diffusion respectively;
s3, performing dimension reduction processing on the three-dimensional matrix by adopting a spiral curve, and then sequentially performing index scrambling and one-dimensional Arnold scrambling;
and S4, diffusing by adopting a classical mode-adding and modulus-taking circulation left-shift method to obtain a ciphertext image.
In specific implementation, as a preferred embodiment of the present invention, in step S1, generating a key by using the SHA-512 algorithm, and processing the generated key specifically includes:
s11, bringing the image P with the size of MNK into an SHA-512 algorithm to obtain a group of hexadecimal key keys with the length of 128 bits;
s12, converting the key in hexadecimal into the character string key in binary 1 (ii) a A one-bit hexadecimal number is equal to a four-bit binary number so the string length becomes 512.
S13, key the character string 1 Respectively carrying out exclusive or on each two adjacent bits to obtain a group of character strings key2 with the length of 256 bits;
s14, converting the character string key2 into four parts with equal length to obtain four values, namely K 1 ，K 2 ，K 3 ，K 4 ：
In the above formula, K 1 Representing a first partial key, K 2 Is shown asTwo-part key, K 3 Representing a third partial key, K 4 Representing a fourth partial key;
s15, obtaining four values K 1 ，K 2 ，K 3 ，K 4 Calculating two sets of parameters x required by NCCS 0 And an initial value μ, the calculation formula is as follows:
in the above formula,. Mu.denotes a parameter of NCCS,. Mu. 1 Indicating a preferred first value of μ, μ 2 Representing the second value of μ, roundn () representing a rounding function, x 0 Denotes the initial value, x, of NCCS 1 Represents x 0 Preferably a first initial value, x 2 Represents x 0 The second desirable initial value, mod () represents a modulo function.
In specific implementation, as a preferred embodiment of the present invention, in step S2, the substituting the processed secret key into the improved Chebyshev chaotic system NCCS to generate two pseudo random sequences for scrambling and diffusing respectively includes:
s21, calculating the needed parameter mu = mu of the NCCS 1 Substituting the initial value into NCCS to generate a group of sequences A with the length of M +3MNK, wherein the sequences are divided into four parts A 1 ,A 2 ,A 3 ,A 4 In which the pseudo-random sequence A 1 The length is M, and the method is used for inter-row index scrambling; pseudo-random sequence A 2 The length is MNK, and the MNK is used for in-line index scrambling; pseudo-random sequence A 3 ,A 4 The length is MNK and is used for generating parameters of one-dimensional Arnold scrambling;
s22, calculating the needed parameter mu = mu of the NCCS 2 And an initial value x 0 ＝x 2 Substituting into NCCS to generate a group of 2 MNK-long sequences B, and equally dividing the sequences B into two parts B 1 ,B 2 And the length is MN for diffusion.
In practical implementation, as a preferred embodiment of the present invention, the scrambling method in this embodiment is applied to the multi-channel image P of the MNK, where the ranges of M, N, and K are not limited at all. And in consideration of the problem of time complexity in the algorithm operation process, performing dimension reduction processing on the three-dimensional matrix twice. Each dimensionality reduction is accompanied with the occurrence of scrambling, and the method is divided into three steps: the first step is to scan three-dimensional side cut surfaces one by using a spiral curve, wherein each cut surface is used as one row of a two-dimensional matrix as shown in the figure; the second step is to carry out row scrambling on the two-dimensional matrix and convert the two-dimensional matrix into a one-dimensional matrix; the third step is to perform one-dimensional Arnold scrambling on the one-dimensional matrix. The method specifically comprises the following steps:
s31, presetting a disorder process: scanning three-dimensional matrix P side sections one by one from the leftmost side by using a spiral curve to obtain pixel values, wherein each section is used as a two-dimensional matrix P 1 One row of (2), namely, reducing the dimension of the three-dimensional matrix into a two-dimensional matrix with the size of M (NK);
s32, index scrambling: for two-dimensional matrix P 1 According to a pseudo-random sequence A 1 Performing row scrambling once, and converting into one-dimensional matrix P 2 Size 1 × (MNK); according to a pseudo-random sequence A 2 Performing index scrambling once to obtain a one-dimensional matrix P 3 ；
S33, one-dimensional Arnold scrambling: for a one-dimensional matrix P 3 One-dimensional Arnold transformation is carried out to obtain a matrix C after scrambling 0 。
In specific implementation, as a preferred embodiment of the present invention, in step S4, diffusion is performed by using a classical modulo addition cyclic left shift method to obtain a ciphertext image, which specifically includes:
pseudo-random sequence B 1 ,B 2 The decimal numbers are (0, 1) and the length is MNK, and the pseudorandom sequence S is obtained by mapping the decimal numbers to (0, 255) through the following formula 1 ,S 2 ；
S 1 ＝mod(floor(B 1 *2^16),256)
S 2 ＝mod(floor(B 2 *2^16),256)
Will be originalThe matrix P is converted into a one-dimensional matrix P 0 1MNK in size; scrambled matrix C 0 A size of 1MNK; pseudo-random sequence S 1 ,S 2 All the sizes are 1 × MNK;
according to the original matrix P 0 Pseudo-random sequence S 1 The matrix C is then aligned as follows 0 Performing forward diffusion to obtain a matrix C 1 ；
C i (0)＝mod(C i-1 (0)+S i (1)+P i (0),256)＜＜＜LSB 3 (C i-1 (0))
In the above formula, C i-1 (0) Denotes the matrix obtained by diffusion of the (i-1) th order, S i (1) The ith value, P, representing a pseudo-random sequence i Representing the original matrix, LSB, after the i-th diffusion 3 Representing a circular left shift function;
according to the original matrix P 0 Pseudo-random sequence, to the matrix C according to 1 Performing reverse diffusion to obtain a matrix C;
C i (1)＝mod(C i+1 (1)+S i (2)+P i (0),256)＜＜＜LSB 3 (C i+1 (1))
in the above formula, C i+1 (1) Denotes the matrix obtained by diffusion of the (i + 1) th order, S i (2) The ith value, P, representing a pseudo-random sequence i Representing the original matrix after the ith diffusion.
Corresponding to the multi-type image joint encryption method in the application, the application also provides a multi-type image joint encryption system, which comprises: the device comprises a key processing module, a chaotic sequence generating module, a scrambling module and a diffusion module, wherein:
the key processing module is used for generating a key through an SHA-512 algorithm and processing the generated key;
the chaotic sequence generation module is used for substituting the processed key into an improved Chebyshev chaotic system NCCS to generate two pseudo-random sequences which are respectively used for scrambling and diffusion;
the scrambling module is used for performing dimension reduction processing on the three-dimensional matrix by adopting a spiral curve, and then sequentially performing index scrambling and one-dimensional Arnold scrambling;
and the diffusion module is used for performing diffusion by adopting a classical modulus addition and left shift method to obtain a ciphertext image.
Simulation experiment results and performance analysis show that the method provided by the invention can resist common attacks such as: salt and pepper noise attack, gaussian attack, cutting attack and the like, and has better safety and good operation efficiency. Comparison with various documents shows that the simulation experiment result made by the method is superior to the prior scheme. In addition, the encrypted data volume of the multi-type images provided by the invention is larger, so that the method is often combined with the image compression related knowledge, and the aim of improving the algorithm efficiency is further achieved.
For the embodiments of the present invention, the description is simple because it corresponds to the above embodiments, and for the related similarities, please refer to the description in the above embodiments, and the detailed description is omitted here.
The embodiment of the application also discloses a computer-readable storage medium, wherein a computer instruction set is stored in the computer-readable storage medium, and when the computer instruction set is executed by a processor, the multi-type image joint encryption method provided by any one of the above embodiments is implemented.
In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units may be a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (7)
1. A multi-type image joint encryption method is characterized by comprising the following steps:
generating a key through an SHA-512 algorithm, and processing the generated key;
substituting the processed key into an improved Chebyshev chaotic system NCCS to generate two pseudo-random sequences for scrambling and diffusion respectively;
performing dimensionality reduction processing on the three-dimensional matrix by adopting a spiral curve, and sequentially performing index scrambling and one-dimensional Arnold scrambling;
and diffusing by adopting a classical modulus-adding circulation left shift method to obtain a ciphertext image.
2. The multi-type image joint encryption method according to claim 1, wherein the generating of the key by the SHA-512 algorithm and the processing of the generated key comprise:
the image P with the MNK size is brought into an SHA-512 algorithm to obtain a group of 128-bit hexadecimal key;
converting hexadecimal key into binary character string key 1 ；
Key the character string 1 Respectively carrying out exclusive OR on every two adjacent bits to obtain a group of character string keys 2 with the length of 256 bits;
converting the character string key2 into four parts with equal length to obtain four values, namely K 1 ，K 2 ，K 3 ，K 4 ：
In the above formula, K 1 Representing a first partial key, K 2 Representing a second partial key, K 3 Representing a third partial key, K 4 Representing a fourth partial key;
and calculating parameters and initial values required by two sets of NCCS according to the obtained four values, wherein the calculation formula is as follows:
in the above formula,. Mu.represents a parameter of NCCS,. Mu. 1 Indicating a preferred first value of μ, μ 2 Representing the second value of μ, roundn () representing a rounding function, x 0 Denotes the initial value, x, of NCCS 1 Represents x 0 Preferably a first initial value, x 2 Represents x 0 Preferably, the second initial value, mod () represents a modulo function.
3. The multi-type image joint encryption method according to claim 1, wherein the substituting the processed key into the modified Chebyshev chaotic system NCCS generates two pseudo-random sequences for scrambling and diffusion respectively, specifically comprising:
the calculated parameters mu = mu required for NCCS 1 Substituting the initial value into NCCS to generate a group of sequences A with the length of M +3MNK, wherein the sequences are divided into four parts A 1 ,A 2 ,A 3 ,A 4 Wherein the pseudorandom sequence A 1 The length is M, and the method is used for scrambling indexes among lines; pseudo-random sequence A 2 The length is MNK and is used for in-line index scrambling; pseudo-random sequence A 3 ,A 4 The length is MNK, and the MNK is used for generating parameters of one-dimensional Arnold scrambling;
the calculated NCCS required parameter μ = μ 2 And an initial value x 0 ＝x 2 Substituting NCCS to generate a group of 2 MNK-long sequences B, and equally dividing the sequences B into two parts B 1 ,B 2 And the length is MN for diffusion.
4. The multi-type image joint encryption method according to claim 1, wherein the dimensionality reduction processing is performed on the three-dimensional matrix by using the spiral curve, and then index scrambling and one-dimensional Arnold scrambling are sequentially performed, specifically comprising:
scanning the P side section of the three-dimensional matrix one by one from the leftmost side by using a spiral curve to obtainPixel values, each slice being a two-dimensional matrix P 1 One row of (2), namely, reducing the dimension of the three-dimensional matrix into a two-dimensional matrix with the size of M (NK);
for two-dimensional matrix P 1 According to a pseudo-random sequence A 1 Performing row scrambling once, and converting into one-dimensional matrix P 2 Size 1 × (MNK); according to a pseudo-random sequence A 2 Performing index scrambling once to obtain a one-dimensional matrix P 3 ；
For a one-dimensional matrix P 3 One-dimensional Arnold transformation is carried out to obtain a matrix C after scrambling 0 。
5. The multi-type image joint encryption method according to claim 1, wherein the diffusion is performed by a classical modulo addition cyclic left shift method to obtain a ciphertext image, specifically comprising:
pseudo-random sequence B 1 ,B 2 The decimal numbers are (0, 1) and the length is MNK, and the pseudorandom sequence S is obtained by mapping the decimal numbers to (0, 255) through the following formula 1 ,S 2 ；
S 1 ＝mod(floor(B 1 *2^16),256)
S 2 ＝mod(floor(B 2 *2^16),256)
Converting the original matrix P into a one-dimensional matrix P 0 1MNK in size; scrambled matrix C 0 A size of 1MNK; pseudo-random sequence S 1 ,S 2 All the sizes are 1 × MNK;
according to the original matrix P 0 Pseudo-random sequence S 1 To the matrix C according to the following formula 0 Performing forward diffusion to obtain a matrix C 1 ；
C i (0)＝mod(C i-1 (0)+S i (1)+P i (0),256)＜＜＜LSB 3 (C i-1 (0))
In the above formula, C i-1 (0) Denotes the matrix obtained by diffusion of the (i-1) th order, S i (1) The ith value, P, representing a pseudo-random sequence i Representing the original matrix, LSB, after the ith diffusion 3 Representing a circular left shift function
According to the original matrix P 0 Pseudo-random sequence, to the matrix C according to 1 Performing reverse diffusion to obtain a matrix C;
C i (1)＝mod(C i+1 (1)+S i (2)+P i (0),256)＜＜＜LSB 3 (C i+1 (1))
in the above formula, C i+1 (1) Denotes the matrix obtained by diffusion of the (i + 1) th order, S i (2) The ith value, P, representing a pseudo-random sequence i Representing the original matrix after the ith diffusion.
6. A multi-type image joint encryption system, comprising:
the key processing module is used for generating a key through an SHA-512 algorithm and processing the generated key;
the chaotic sequence generation module is used for substituting the processed key into an improved Chebyshev chaotic system NCCS to generate two pseudo-random sequences for scrambling and diffusion respectively;
the scrambling module is used for performing dimension reduction processing on the three-dimensional matrix by adopting a spiral curve, and then sequentially performing index scrambling and one-dimensional Arnold scrambling;
and the diffusion module is used for performing diffusion by adopting a classical modulus addition and left shift method to obtain a ciphertext image.
7. A computer-readable storage medium having a set of computer instructions stored therein; the set of computer instructions, when executed by a processor, implement a multi-type image joint encryption method as claimed in any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211372018.5A CN115766027A (en) | 2022-11-03 | 2022-11-03 | Multi-type image joint encryption method, system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211372018.5A CN115766027A (en) | 2022-11-03 | 2022-11-03 | Multi-type image joint encryption method, system and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115766027A true CN115766027A (en) | 2023-03-07 |
Family
ID=85357790
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211372018.5A Pending CN115766027A (en) | 2022-11-03 | 2022-11-03 | Multi-type image joint encryption method, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115766027A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110311042A1 (en) * | 2008-10-23 | 2011-12-22 | University Of Ulster | Encryption method |
| CN108898025A (en) * | 2018-06-25 | 2018-11-27 | 河南大学 | New chaotic image encryption method based on dual scramble and DNA encoding |
| CN113099069A (en) * | 2021-04-12 | 2021-07-09 | 中国矿业大学 | Multi-image encryption method based on three-dimensional spiral model |
-
2022
- 2022-11-03 CN CN202211372018.5A patent/CN115766027A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110311042A1 (en) * | 2008-10-23 | 2011-12-22 | University Of Ulster | Encryption method |
| CN108898025A (en) * | 2018-06-25 | 2018-11-27 | 河南大学 | New chaotic image encryption method based on dual scramble and DNA encoding |
| CN113099069A (en) * | 2021-04-12 | 2021-07-09 | 中国矿业大学 | Multi-image encryption method based on three-dimensional spiral model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chai et al. | Combining improved genetic algorithm and matrix semi-tensor product (STP) in color image encryption | |
| Hanif et al. | A novel and efficient 3D multiple images encryption scheme based on chaotic systems and swapping operations | |
| Hosny et al. | Novel encryption for color images using fractional-order hyperchaotic system | |
| CN112422266B (en) | Hyperchaotic encryption method based on Joseph traversal and bit plane reconstruction | |
| Malik et al. | Color image encryption algorithm based on hyper-chaos and DNA computing | |
| CN109660696B (en) | New image encryption method | |
| WO2008154130A1 (en) | System and a method for securing information | |
| CN107292184B (en) | Image encryption method, device and key stream generating method and key stream generator | |
| CN110889877A (en) | Image encryption method based on L-F cascade chaos and 3D bit scrambling | |
| CN112202545B (en) | Image encryption method based on Y-type filling curve and variable-step Joseph traversal | |
| CN109361830B (en) | Image encryption method based on plaintext | |
| Hanif et al. | A novel and efficient multiple RGB images cipher based on chaotic system and circular shift operations | |
| Karawia et al. | New encryption algorithm using bit-level permutation and non-invertible chaotic map | |
| Fang et al. | A secure chaotic block image encryption algorithm using generative adversarial networks and DNA sequence coding | |
| CN115766962A (en) | Multi-key image encryption method based on five-dimensional conservative hyperchaotic system | |
| CN109586895B (en) | Novel color image encryption method | |
| Es-Sabry et al. | Securing images using high dimensional chaotic maps and DNA encoding techniques | |
| CN113691362A (en) | Bit plane image compression encryption algorithm based on hyperchaotic system and DNA coding | |
| CN115580687B (en) | Multi-image encryption method based on variable parameter hyperchaotic system and S-shaped diffusion | |
| Alhassan et al. | Enhancing image security during transmission using residue number system and k-shuffle | |
| CN115766027A (en) | Multi-type image joint encryption method, system and storage medium | |
| CN112788196B (en) | Double-image encryption method based on convolution neural network dynamic self-adaptive diffusion | |
| CN111131656B (en) | Image encryption method based on bit-level scrambling and dynamic superposition diffusion | |
| CN110944096A (en) | Image encryption method for meaningful ciphertext | |
| Hassan et al. | Henon chaotic map-based image encryption scheme using bit-level circular shift |
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 |