CN115170380A - Image layered scrambling encryption method based on chaotic mapping - Google Patents

Image layered scrambling encryption method based on chaotic mapping Download PDF

Info

Publication number
CN115170380A
CN115170380A CN202210904543.0A CN202210904543A CN115170380A CN 115170380 A CN115170380 A CN 115170380A CN 202210904543 A CN202210904543 A CN 202210904543A CN 115170380 A CN115170380 A CN 115170380A
Authority
CN
China
Prior art keywords
image
chaotic
sequence
scrambling
image matrix
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
Application number
CN202210904543.0A
Other languages
Chinese (zh)
Inventor
唐加能
张泽宗
陈培阳
张烽
倪晖
黄婷婷
郑超英
陈锦源
黄种明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujian Mmelec Electronics Co ltd
Huaqiao University
Original Assignee
Fujian Mmelec Electronics Co ltd
Huaqiao University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fujian Mmelec Electronics Co ltd, Huaqiao University filed Critical Fujian Mmelec Electronics Co ltd
Priority to CN202210904543.0A priority Critical patent/CN115170380A/en
Publication of CN115170380A publication Critical patent/CN115170380A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00General purpose image data processing
    • G06T1/0021Image watermarking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/16Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00Computing arrangements based on specific mathematical models
    • G06N7/08Computing arrangements based on specific mathematical models using chaos models or non-linear system models

Abstract

The invention discloses an image layered scrambling encryption method based on chaotic mapping, which converts a gray level image into an image matrix; iterating 2D-ICM chaotic mapping to generate two chaotic sequences, and then performing pixel diffusion on an image matrix by using one chaotic sequence; layering the diffused image into a high-level image and a low-level image; another chaotic sequence generated by the 2D-ICM is subjected to descending order arrangement to generate a corresponding position sequence for scrambling a low-layer image; iteration 1DCLC chaotic mapping generates a chaotic sequence, and then the chaotic sequence is subjected to descending order arrangement to generate a corresponding position sequence for scrambling a high-level image; combining the high-layer image and the low-layer image after scrambling again to generate a scrambled image matrix; and diffusing the scrambled image again by using all the chaotic sequences to obtain a ciphertext image. The invention uses chaotic mapping and layered images for encryption, has ideal encryption efficiency and can realize ideal encryption effect.

Description

Image layered scrambling encryption method based on chaotic mapping
Technical Field
The invention relates to the technical field of information security, in particular to an image layered scrambling encryption method based on chaotic mapping.
Background
With the rapid development of network technology, the form of modern information communication and storage has changed greatly. Because the image carries information more richly and intuitively than characters, the image plays a vital role in modern information exchange and storage, but the image is extremely vulnerable to malicious attacks in the transmission and storage processes, so that sensitive information in the image is leaked. Therefore, the security problem of digital images becomes an important issue in the field of information security. When the traditional data encryption method, such as AES and DES algorithms, is applied to image encryption, the defects of low encryption efficiency and the like exist.
The chaotic system has the characteristics of strong internal randomness, ergodicity, nonlinearity and the like, so that the chaotic system is very suitable for constructing a high-security image encryption system.
In recent years, researchers have proposed many image encryption algorithms based on bit-plane decomposition. Xu et al propose an encryption algorithm based on bit-plane decomposition, which is not ideal in encryption speed, although the encryption effect is ideal. Zhang et al also proposed an encryption scheme based on bit-plane decomposition, which, although increasing the encryption speed compared to Xu et al, does not achieve the ideal effect on the security of the encryption algorithm.
Therefore, how to provide an image layered scrambling encryption method based on chaotic mapping becomes an important problem, which can achieve higher security and higher execution efficiency.
Disclosure of Invention
Aiming at the problems in the prior art, the invention aims to provide an image layered scrambling encryption method based on chaotic mapping, which can realize higher safety and higher execution efficiency.
In order to achieve the purpose, the invention adopts the technical scheme that:
an image layered scrambling encryption method based on chaotic mapping comprises the following steps:
converting a gray image with the size of M multiplied by N into an image matrix P with the same size;
step two, generation of initial conditions: using SHA-256 function to combine with image matrix P to generate hash value hash, and then using the hash and preset initial condition x 0 ,y 0 ,z 00000 Calculating initialization conditions x for 2D-ICM and 1DCLC 1 ,y 1 ,z 11111
The 2D-ICM is a two-dimensional discrete chaotic map; the 1DCLC is a one-dimensional discrete chaotic map;
step three, pixel diffusion: acquiring 2 chaotic sequences Y and Z corresponding to the 2D-ICM based on the initialization condition of the second step, processing to obtain new sequences A1 and A2, and performing pixel diffusion on the image matrix P by using an A1 sequence combined diffusion method to obtain a diffused image matrix P1;
step four, pixel layering scrambling: acquiring a chaotic sequence X corresponding to the 1DCLC based on the initialization condition of the second step, and processing to obtain a new sequence A3; dividing the image matrix P1 into a high-level image matrix P11 and a low-level image matrix P12, and performing descending order arrangement on the sequences A3 and A2 to respectively generate corresponding index sequences b3 and b2; respectively carrying out pixel scrambling on the high-layer image matrix P11 and the low-layer image matrix P12 by utilizing the index matrixes b3 and b2, and recombining the high-layer image matrix and the low-layer image matrix after scrambling to obtain an image matrix H after layered scrambling;
step five, pixel diffusion: and diffusing the image matrix H based on the chaotic sequences A1, A2 and A3 to obtain an encrypted image C.
The mathematical definition of the 2D-ICM is as follows:
Figure BDA0003771982330000021
wherein, y n And z n Is the nth iteration value of the system, sigma and rho are system control parameters, and sigma is not equal to 0, rho is not equal to 0;
the mathematical definition formula of the 1DCLC is as follows:
Figure BDA0003771982330000031
wherein x is n Is the nth iteration value of the system, and α and β are system control parameters.
The specific calculation method for generating the initialization conditions in the second step comprises the following steps: generating a 256-bit hash value hash by using an SHA-256 function in combination with an image matrix P, dividing the generated hash value into four groups, converting each group of four-bit data into decimal numbers, and obtaining 64 converted decimal numbers k 1 ,k 2 ,…,k 64 (ii) a Initialization Condition x 1 ,y 1 ,z 11111 The calculation method comprises the following steps:
Figure BDA0003771982330000032
Figure BDA0003771982330000033
where mod is the remainder function, mean is the averaging function, x 0 ,y 0 ,z 00000 Is a preset initial condition.
The sequence generation method in the third step comprises the following steps: will initialize the condition y 1 ,z 111 Substituting 2D-ICM, iterating N 0 + MN times, dropping the previous N 0 And (3) obtaining a sequence Y and a sequence Z, and processing to obtain sequences A1 and A2:
Figure BDA0003771982330000034
wherein floor denotes an integer function, N 0 =(k 1 +k 4 +k 8 +k 16 +k 32 +k 48 +k 64 ) X 5 is the number of discarded entries of the sequence.
The method for generating the chaotic sequence in the fourth step comprises the following steps:
will initialize the condition x 111 Substitution 1DCLC, iteration N 0 + MN times, dropping the previous N 0 And (iv) obtaining a sequence X, and processing to obtain a sequence A3: a3= mod (floor (X × 10) 13 ),M×N)+1;
The image layering method in the fourth step comprises the following steps:
depending on the pixel value range of an 8-bit gray scale image, which is usually [0,255], all pixels of the image are decomposed in hexadecimal, the whole image can be divided into two planes, the upper plane places the upper four bits of the pixel decomposition to obtain an upper image matrix P11, and the lower plane places the lower four bits of the pixel decomposition to obtain a lower image matrix P12.
The specific method for scrambling the image comprises the following steps:
scrambling and arranging the high-layer image matrix P11 according to the index sequence b3 to obtain a middle sequence H1, scrambling and arranging the low-layer image matrix P12 according to the index sequence b2 to obtain a middle sequence H2: h1 (i) = P11 (b 3 (i)), H2 (i) = P12 (b 2 (i)), i =1,2,3, …, M × N, and the obtained H1 and H2 are recombined and converted into an image matrix, resulting in a scrambled image matrix H.
And the diffusion methods in the third step and the fifth step both adopt the bitwise exclusive-OR diffusion operation.
The method for generating the image matrix P1 in the third step comprises the following steps:
Figure BDA0003771982330000041
10. the image layered scrambling encryption method based on chaotic mapping according to claim 8, characterized in that: the generation method of the encrypted image matrix C in the fifth step comprises the following steps:
constructing a chaotic sequence B by using the chaotic sequences A1, A2 and A3: b = mod (A1 + A2+ a3,256); converting the sequence B into a matrix B1 with the size of M multiplied by N, and then carrying out exclusive OR operation on the matrix B1 and the image matrix H to obtain an encrypted image matrix C:
Figure BDA0003771982330000042
the invention has the advantages that:
1. a new one-dimensional discrete chaotic map is constructed by combining the traditional Logistic map with a cosine function, the chaotic behavior and the key space of the map are improved, and the encryption safety is further improved.
2. By using two low-dimensional discrete chaotic mappings to encrypt the image, the execution efficiency of an encryption algorithm is improved, and the dependence on the operational capability of algorithm execution equipment is reduced.
3. By using the SHA-256 function in combination with the image matrix to generate the hash value as part of the initialization key, the capability of the algorithm to resist the selected plaintext attack is improved.
4. By using the method of image layered scrambling, the security performance and the execution efficiency in the scrambling algorithm are balanced.
Drawings
The invention will be further described with reference to the following examples with reference to the accompanying drawings.
FIG. 1 is a flow chart of an image hierarchical scrambling encryption method based on chaotic mapping according to the present invention.
FIG. 2 is an encryption flow diagram of an image layered scrambling encryption method based on chaotic mapping according to the present invention.
Fig. 3 is a schematic diagram of the overall encryption process of the present invention.
Fig. 4 is a test gray scale image of the present invention.
FIG. 5 is a graph of the encryption results of the test image of the present invention.
Fig. 6 is a decrypted image of the inventive test.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar structures, and thus their detailed description will be omitted.
The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention may be practiced without one or more of the specific details, or with other methods, components, materials, and so forth. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the invention.
In the following description, numerous specific details are set forth in order to provide a more thorough understanding of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without one or more of these specific details. In other instances, well-known features have not been described in order to avoid obscuring the invention.
As shown in fig. 1, the invention discloses an image layered scrambling encryption method based on chaotic mapping, which comprises the following steps:
converting a gray image with the size of M multiplied by N into an image matrix P with the same size;
step two, generation of initial conditions: using SHA-256 function to combine with image matrix P to generate hash value hash, and then using the hash and preset initial condition x 0 ,y 0 ,z 00000 Calculating initialization conditions x for 2D-ICM and 1DCLC 1 ,y 1 ,z 11111
Step three, pixel diffusion: acquiring 2 chaotic sequences Y and Z corresponding to the 2D-ICM based on the initialization condition of the second step, processing to obtain new sequences A1 and A2, and performing pixel diffusion on the image matrix P by using an A1 sequence combined diffusion method to obtain a diffused image matrix P1;
step four, image layered scrambling: acquiring a chaotic sequence X corresponding to the 1DCLC based on the initialization condition of the second step, and processing to obtain a new sequence A3; dividing the image matrix P1 into a high-level image matrix P11 and a low-level image matrix P12, and performing descending order arrangement on the sequences A3 and A2 to respectively generate corresponding index sequences b3 and b2; and respectively carrying out pixel scrambling on the high-layer image matrix P11 and the low-layer image matrix P12 by using the index matrixes b3 and b2, and recombining the high-layer image matrix and the low-layer image matrix after scrambling to obtain an image matrix H after hierarchical scrambling.
Step five, pixel diffusion: and diffusing the image matrix H based on the chaotic sequences A1, A2 and A3 to obtain an encrypted image C.
The 2D-ICM is a two-dimensional discrete chaotic map, and the mathematical definition formula is as follows:
Figure BDA0003771982330000071
wherein, y n And z n Is the nth iteration value of the system, sigma and rho are system control parameters, and sigma is not equal to 0, rho is not equal to 0;
the 1DCLC is a one-dimensional discrete chaotic map, and the mathematical definition formula is as follows:
Figure BDA0003771982330000072
wherein x is n Is the nth iteration value of the system, and alpha and beta are system control parameters.
Referring to fig. 1 and 2 in conjunction with the above steps, the detailed implementation steps of the encryption of the present invention are as follows.
The specific calculation method of the initialization conditions in the second step is as follows: generating a 256-bit hash value hash by using an SHA-256 function in combination with an image matrix P, dividing the generated hash value into four groups, converting each group of four-bit data into decimal numbers, and obtaining 64 converted decimal numbers k 1 ,k 2 ,…,k 64 (ii) a Initialization Condition x 1 ,y 1 ,z 11111 Comprises the following steps:
Figure BDA0003771982330000073
Figure BDA0003771982330000081
where mod is the remainder function, mean is the averaging function, x 0 ,y 0 ,z 00000 Is a preset initial condition.
The specific method for generating the sequence in the third step comprises the following steps: will initialize the condition y 1 ,z 111 Substituting 2D-ICM, iterating N 0 + MN times, dropping the previous N 0 The sequence Y and the sequence Z are obtained, and the sequence A1 and the sequence Z are obtained after processingA2:
Figure BDA0003771982330000082
Wherein floor denotes an integer function, N 0 =(k 1 +k 4 +k 8 +k 16 +k 32 +k 48 +k 64 ) X 5 is the discard item.
The specific method for generating the image matrix P1 by diffusion in the third step is as follows:
Figure BDA0003771982330000083
the specific method for generating the chaotic sequence in the fourth step comprises the following steps:
will initialize the condition x 111 Substitution 1DCLC, same iteration N 0 + MN times, dropping the previous N 0 And (3) obtaining a sequence X, and processing to obtain a sequence A3: a3= mod (floor (X × 10) 13 ),M×N)+1;
The image layering method in the fourth step comprises the following specific steps:
depending on the pixel value range of an 8-bit gray scale image, which is usually [0,255], all pixels of the image are decomposed in hexadecimal, the whole image can be divided into two planes, the upper plane places the upper four bits of the pixel decomposition to obtain an upper image matrix P11, and the lower plane places the lower four bits of the pixel decomposition to obtain a lower image matrix P12.
The specific method for scrambling the image in the fourth step is as follows:
scrambling and arranging the high-layer image matrix P11 according to the index sequence b3 to obtain a middle sequence H1, scrambling and arranging the low-layer image matrix P12 according to the index sequence b2 to obtain a middle sequence H2: h1 (i) = P11 (b 3 (i)), H2 (i) = P12 (b 2 (i)), i =1,2,3, …, M × N, and the obtained H1 and H2 are recombined and converted into an image matrix, resulting in a scrambled image matrix H.
The specific method for generating the encrypted image matrix C in the step five by diffusion comprises the following steps:
constructing a chaotic sequence B by utilizing the chaotic sequences A1, A2 and A3: b = mod (A1 + A2+ A3, 256);
converting the sequence B into a matrix B1 with the size of M multiplied by N, and then carrying out exclusive OR operation on the matrix B1 and the image matrix H to obtain an encrypted image matrix C:
Figure BDA0003771982330000091
in order to better explain the encryption process of the chaos mapping based image layered scrambling encryption method of the present invention, the detailed steps can be combined, referring to fig. 3, fig. 3 is a schematic diagram of the overall encryption of the chaos mapping based image layered scrambling encryption method of the present invention.
The decryption method of the encryption method is the reverse process of the original encryption method, which is not described in detail.
With reference to fig. 4 to 6, the present invention uses MATLAB2020b software to set initial conditions (x) 0 ,y 0 ,z 00000 ) = (0.2,0.2,0.2,12,0.3264,12,0.3264), a simulation experiment is performed using a hash value generated by combining a hash function with a plaintext image and a set initial condition as a key, fig. 4 is an input original image, fig. 5 is a ciphertext image obtained by encrypting the original image by using the encryption algorithm, and fig. 6 is a decrypted image obtained by decrypting the ciphertext image by using the inverse process of the encryption algorithm.
The invention has the advantages that:
1. a new one-dimensional discrete chaotic map is constructed by combining the traditional Logistic map with a cosine function, the chaotic behavior and the key space of the map are improved, and the encryption safety is further improved.
2. By using two low-dimensional discrete chaotic mappings to encrypt the image, the execution efficiency of an encryption algorithm is improved, and the dependence on the operational capability of algorithm execution equipment is reduced.
3. By using the SHA-256 function in combination with the image matrix to generate the hash value as part of the initialization key, the capability of the algorithm to resist the selected plaintext attack is improved.
4. By using the method of image layered scrambling, the security performance and the execution efficiency in the scrambling algorithm are balanced.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, and may also be implemented by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above section "exemplary methods" of the present description, when said program product is run on the terminal device.
A program product for implementing the above method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Moreover, although the steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

Claims (10)

1. An image layered scrambling encryption method based on chaotic mapping is characterized in that: the method comprises the following steps:
converting a gray image with the size of M multiplied by N into an image matrix P with the same size;
step two, generation of initial conditions: using SHA-256 function to combine with image matrix P to generate hash value hash, and then using the hash and preset initial condition x 0 ,y 0 ,z 00000 Calculating initialization conditions x for 2D-ICM and 1DCLC 1 ,y 1 ,z 11111
The 2D-ICM is a two-dimensional discrete chaotic map; the 1DCLC is a one-dimensional discrete chaotic map;
step three, pixel diffusion: acquiring 2 chaotic sequences Y and Z corresponding to the 2D-ICM based on the initialization condition of the second step, processing to obtain new sequences A1 and A2, and performing pixel diffusion on the image matrix P by using an A1 sequence combined diffusion method to obtain a diffused image matrix P1;
step four, pixel layering scrambling: acquiring a chaotic sequence X corresponding to the 1DCLC based on the initialization condition of the second step, and processing to obtain a new sequence A3; dividing the image matrix P1 into a high-level image matrix P11 and a low-level image matrix P12, and performing descending order arrangement on the sequences A3 and A2 to respectively generate corresponding index sequences b3 and b2; pixel scrambling is carried out on the high-layer image matrix P11 and the low-layer image matrix P12 respectively by utilizing the index matrixes b3 and b2, and the high-layer image matrix and the low-layer image matrix after scrambling are recombined to obtain an image matrix H after layered scrambling;
step five, pixel diffusion: and diffusing the image matrix H based on the chaotic sequences A1, A2 and A3 to obtain an encrypted image C.
2. The chaos mapping-based image layered scrambling encryption method according to claim 1, wherein: the mathematical definition of the 2D-ICM is as follows:
Figure FDA0003771982320000011
wherein, y n And z n Is the nth iteration value of the system, sigma and rho are system control parameters, and sigma is not equal to 0, rho is not equal to 0;
the mathematical definition formula of the 1DCLC is as follows:
Figure FDA0003771982320000021
wherein x is n Is the nth iteration value of the system, and alpha and beta are system control parameters.
3. The image layered scrambling encryption method based on chaotic mapping as claimed in claim 1, characterized in that: the specific calculation method for generating the initialization conditions in the second step comprises the following steps: generating a 256-bit hash value hash by using an SHA-256 function in combination with an image matrix P, dividing the generated hash value into four groups, converting each group of four-bit data into decimal numbers, and obtaining 64 converted decimal numbers k 1 ,k 2 ,…,k 64 (ii) a Initialization Condition x 1 ,y 1 ,z 11111 The calculation method comprises the following steps:
Figure FDA0003771982320000022
Figure FDA0003771982320000023
where mod is the remainder function, mean is the averaging function, x 0 ,y 0 ,z 00000 Is presetSetting the initial condition.
4. The image layered scrambling encryption method based on chaotic mapping as claimed in claim 1, characterized in that: the sequence generation method in the third step comprises the following steps: will initialize the condition y 1 ,z 111 Substituting 2D-ICM, iterating N 0 + MN times, dropping the previous N 0 And (3) obtaining a sequence Y and a sequence Z, and processing to obtain sequences A1 and A2:
Figure FDA0003771982320000031
wherein floor represents the rounding function, N 0 =(k 1 +k 4 +k 8 +k 16 +k 32 +k 48 +k 64 ) X 5 is the number of discarded entries of the sequence.
5. The image layered scrambling encryption method based on chaotic mapping as claimed in claim 1, characterized in that: the method for generating the chaotic sequence in the fourth step comprises the following steps:
will initialize the condition x 111 Substitution into 1DCLC, iteration N 0 + MN times, dropping the previous N 0 And (iv) obtaining a sequence X, and processing to obtain a sequence A3: a3= mod (floor (X × 10) 13 ),M×N)+1。
6. The image layered scrambling encryption method based on chaotic mapping as claimed in claim 1, characterized in that: the image layering method in the fourth step comprises the following steps:
depending on the pixel value range of an 8-bit gray scale image, which is usually [0,255], all pixels of the image are decomposed in hexadecimal, the whole image can be divided into two planes, the upper plane places the upper four bits of the pixel decomposition to obtain an upper image matrix P11, and the lower plane places the lower four bits of the pixel decomposition to obtain a lower image matrix P12.
7. The image layered scrambling encryption method based on chaotic mapping as claimed in claim 1, characterized in that: the specific method for scrambling the image comprises the following steps:
scrambling and arranging the high-layer image matrix P11 according to an index sequence b3 to obtain a middle sequence H1, scrambling and arranging the low-layer image matrix P12 according to an index sequence b2 to obtain a middle sequence H2: h1 (i) = P11 (b 3 (i)), H2 (i) = P12 (b 2 (i)), i =1,2,3, …, M × N, and the obtained H1 and H2 are recombined and converted into an image matrix, resulting in a scrambled image matrix H.
8. The image layered scrambling encryption method based on chaotic mapping as claimed in claim 1, characterized in that: and the diffusion methods in the third step and the fifth step both adopt the bitwise exclusive-OR diffusion operation.
9. The image layered scrambling encryption method based on chaotic mapping according to claim 8, characterized in that: the method for generating the image matrix P1 in the third step comprises the following steps:
Figure FDA0003771982320000041
10. the image layered scrambling encryption method based on chaotic mapping according to claim 8, characterized in that: the generation method of the encrypted image matrix C in the fifth step comprises the following steps:
constructing a chaotic sequence B by using the chaotic sequences A1, A2 and A3: b = mod (A1 + A2+ a3,256); converting the sequence B into a matrix B1 with the size of M multiplied by N, and then carrying out exclusive OR operation on the matrix B1 and the image matrix H to obtain an encrypted image matrix C:
Figure FDA0003771982320000042
CN202210904543.0A 2022-07-29 2022-07-29 Image layered scrambling encryption method based on chaotic mapping Pending CN115170380A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210904543.0A CN115170380A (en) 2022-07-29 2022-07-29 Image layered scrambling encryption method based on chaotic mapping

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210904543.0A CN115170380A (en) 2022-07-29 2022-07-29 Image layered scrambling encryption method based on chaotic mapping

Publications (1)

Publication Number Publication Date
CN115170380A true CN115170380A (en) 2022-10-11

Family

ID=83476803

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210904543.0A Pending CN115170380A (en) 2022-07-29 2022-07-29 Image layered scrambling encryption method based on chaotic mapping

Country Status (1)

Country Link
CN (1) CN115170380A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115643001A (en) * 2022-12-25 2023-01-24 武汉恩为科技有限公司 Image encryption method and system based on bit plane and readable storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115643001A (en) * 2022-12-25 2023-01-24 武汉恩为科技有限公司 Image encryption method and system based on bit plane and readable storage medium
CN115643001B (en) * 2022-12-25 2023-03-14 武汉恩为科技有限公司 Image encryption method and system based on bit plane and readable storage medium

Similar Documents

Publication Publication Date Title
Zhang et al. A plaintext-related image encryption algorithm based on chaos
Li et al. A novel plaintext-related image encryption scheme using hyper-chaotic system
Ye et al. An efficient chaotic image encryption algorithm based on a generalized Arnold map
Luo et al. A chaotic map-control-based and the plain image-related cryptosystem
CN1993922B (en) Stream cipher combining system and method
CN111461952B (en) Image encryption method, computer device, and computer-readable storage medium
Zhang et al. Cryptanalysis and improvement of an image encryption algorithm based on hyper-chaotic system and dynamic S-box
Kumar et al. IEHC: An efficient image encryption technique using hybrid chaotic map
CN108122188B (en) Image encryption method
CN113538203A (en) Image encryption method and device based on novel two-dimensional composite chaotic mapping and SHA-256
Ghebleh et al. A novel image encryption algorithm based on piecewise linear chaotic maps and least squares approximation
Gafsi et al. High securing cryptography system for digital image transmission
Abdul Hussien et al. A secure environment using a new lightweight AES encryption algorithm for e-commerce websites
Bouslehi et al. Innovative image encryption scheme based on a new rapid hyperchaotic system and random iterative permutation
CN113098675B (en) Binary data encryption system and method based on polynomial complete homomorphism
CN116488814A (en) FPGA-based data encryption secure computing method
CN108833733A (en) A kind of decryption method of the resume image based on chaos S box
Kumari et al. An encryption scheme based on grain stream cipher and chaos for privacy protection of image data on iot network
CN115170380A (en) Image layered scrambling encryption method based on chaotic mapping
CN108718232A (en) Image encryption method based on AES and chaos
Murillo-Escobar et al. A chaotic encryption algorithm for image privacy based on two pseudorandomly enhanced logistic maps
US20220417000A1 (en) Random position cipher encryption using scrambled ascii strings
Loyka et al. A homomorphic encryption scheme based on affine transforms
CN114826560A (en) Method and system for realizing lightweight block cipher CREF
Fanfakh et al. Simultaneous encryption and authentication of messages over GPUs

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