CN111479032A - Color image encryption method, device and storage medium - Google Patents
Color image encryption method, device and storage medium Download PDFInfo
- Publication number
- CN111479032A CN111479032A CN202010194956.5A CN202010194956A CN111479032A CN 111479032 A CN111479032 A CN 111479032A CN 202010194956 A CN202010194956 A CN 202010194956A CN 111479032 A CN111479032 A CN 111479032A
- Authority
- CN
- China
- Prior art keywords
- matrix
- color image
- scrambling
- pixel
- dimensional
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32267—Methods relating to embedding, encoding, decoding, detection or retrieval operations combined with processing of the image
- H04N1/32272—Encryption or ciphering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- 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
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Signal Processing (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Multimedia (AREA)
- Computer Security & Cryptography (AREA)
- Algebra (AREA)
- Computer Networks & Wireless Communication (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Facsimile Transmission Control (AREA)
Abstract
The invention discloses a color image encryption method, a color image encryption device and a storage medium, wherein the method comprises the following steps: a matrix extraction step of extracting a pixel matrix P of the color image; a cross-plane scrambling step, namely inputting the pixel matrix into a first preset model, and scrambling elements in the pixel matrix P to obtain a scrambling matrix S; and a non-sequential diffusion step, namely inputting the scrambling matrix S into a second preset model, changing element values in the scrambling matrix and outputting a result matrix C. The method fully considers the inherent characteristics of the color image, rapidly and simultaneously changes all pixel positions and pixel values of three color planes of the color image through a cross-plane scrambling step and a non-sequential diffusion step, and achieves good encryption effect and high safety.
Description
Technical Field
The present invention relates to the field of image encryption technologies, and in particular, to a color image encryption method, apparatus, and storage medium.
Background
With the rapid development of information technology nowadays, a large amount of digital information is generated at all times and is spread in various types of network media. Digital images have a very intuitive visual effect and are one of the most widely used formats of digital information. In addition, digital images may contain a lot of potential additional information, for example, a personal photograph may not only show the appearance of someone, but may also convey his age information and health status. Therefore, it is crucial to protect the private information of a digital image from unauthorized use.
Disclosure of Invention
The present invention is directed to solving at least one of the problems of the prior art. Therefore, the invention provides a color image encryption method, which can make full use of the characteristics of a color image, rapidly and simultaneously change all pixel positions and pixel values of three color planes of the color image, and achieve good encryption effect and high security.
The invention also provides a color image encryption device.
The invention also provides a computer readable storage medium.
In a first aspect, an embodiment of the present invention provides a color image encryption method: the method comprises the following steps:
a matrix extraction step of extracting a pixel matrix P of the color image;
a cross-plane scrambling step, namely inputting the pixel matrix P into a first preset model, and scrambling elements in the pixel matrix P to obtain a scrambling matrix S;
and a non-sequential diffusion step, namely inputting the scrambling matrix S into a second preset model, changing element values in the scrambling matrix and outputting a result matrix C.
Further, the pixel matrix P is an RGB matrix.
Further, the cross-plane scrambling step includes inputting the pixel matrix P into a first preset model, and scrambling elements in the pixel matrix P to obtain a scrambling matrix, where:
generating a chaotic sequence L through a preset function;
rearranging the chaotic sequence L into a three-dimensional chaotic matrix A, a two-dimensional chaotic matrix B and a two-dimensional chaotic matrix C;
sequencing the three-dimensional chaotic matrix A according to the size of a preset dimension element value to obtain a three-dimensional index matrix I;
sequencing the two-dimensional chaotic matrix B according to the size of a preset dimension element value to obtain a two-dimensional index matrix T;
sorting the two-dimensional chaotic matrix C according to the size of a preset dimension element value to obtain a two-dimensional index matrix Q;
calculating a first index matrix J from said two-dimensional index matrix T, wherein J (i, m, k) ═ Q (k)jWherein i ∈ {1 … M }, M ═ j-T (k)i-1)modN)+1，k∈{1,2,3}，j∈{1…N}；
Adjusting element values in the pixel matrix P by the three-dimensional index matrix I, and obtaining a second pixel matrix P ', specifically P' (I, j, k) ═ P (I, j, I (I, j, k)), where I ∈ {1 … M }, j ∈ {1 … N }, k ∈ {1 … 3 };
scrambling the positions of the elements in the second pixel matrix P 'by the first index matrix J to obtain a scrambling matrix S, specifically S (m, n, k) ═ P' (r, c, k), where r ═ i, c ═ J (i, J, k), m ═ J (1, J, k) -1) modM) +1, n ═ J (m, J, k), i ∈ {1,2,3 };
m, N denotes the number of rows and columns of the pixel matrix P, respectively.
Further, the preset function is a logistic chaotic function.
Further, in the non-sequential diffusion step, the scrambling matrix S is input to a second preset model, the element values in the scrambling matrix are changed, and the output result matrix C specifically includes:
if i is 1, j is 1, and k is 1, then Ci,j,k＝(Si,j,k+SM,N,3+Ai,j.k)modF，
If i is 1, j is 1, and k is not equal to 1, Ci,j,k＝(Si,j,k+CM,N,k-1+Ai,j.k)modF；
If i is 1, j is not equal to 1, Ci,j,k＝(Si,j,k+CM,j-1,k+Ai,j.k)modF；
If i ≠ 1, then Ci,j,k＝(Si,j,k+Ci-1,j,k+Ai,j.k)modF
M, N respectively represents the number of rows and columns of the pixel matrix P, A represents the three-dimensional chaotic matrix, i ∈ {1 … M }, j ∈ {1 … N }, k ∈ {1 … 3} and F represents the maximum value of the values of the elements in the pixel matrix P.
Further, still include: and a surrounding pixel blurring step, wherein random noise is inserted into the color image.
Further, the inserting the random noise into the color image comprises: and adding random noise into preset bits of edge pixels in a preset color plane of the color image.
In a second aspect, an embodiment of the present invention provides a color image encryption apparatus including:
the matrix extraction module is used for extracting a pixel matrix P of the color image;
the cross-plane scrambling module inputs the pixel matrix P into a first preset model, and scrambles elements in the pixel matrix to obtain a scrambling matrix S;
and the non-sequential diffusion module is used for inputting the scrambling matrix S into a second preset model, changing the element values in the scrambling matrix and outputting a result matrix C.
In a third aspect, an embodiment of the present invention provides a computer-readable storage medium: the method comprises the following steps: the computer-readable storage medium stores computer-executable instructions for causing a computer to perform the color image encryption method.
The color image encryption method, the color image encryption device and the storage medium have the following beneficial effects: the inherent characteristics of the color image are fully considered, all pixel positions and pixel values of three color planes of the color image are rapidly and simultaneously changed through a cross-plane scrambling step and a non-sequential diffusion step, and good encryption effect and high safety are achieved.
Drawings
FIG. 1 is a flow chart illustrating an embodiment of a color image encryption method according to the present invention;
FIG. 2 is a flow chart illustrating a color image encryption method according to another embodiment of the present invention;
FIG. 3 is a schematic diagram of a red plane of a color picture according to an embodiment of a color image encryption method according to the present invention
FIG. 4 is a flow chart illustrating a color image encryption method according to another embodiment of the present invention;
FIG. 5 is a schematic diagram of a three-dimensional chaotic matrix A and a three-dimensional index matrix I in an embodiment of a color image encryption method according to the present invention;
FIG. 6 is a diagram of a two-dimensional chaotic matrix B and a two-dimensional index matrix T in an embodiment of a color image encryption method according to the present invention;
FIG. 7 is a diagram of a two-dimensional chaotic matrix C and a two-dimensional index matrix Q in an embodiment of a color image encryption method according to the present invention;
FIG. 8 is a diagram illustrating a first index matrix J in an embodiment of a color image encryption method according to the invention;
FIG. 9 is a diagram of a pixel matrix P and a second pixel matrix P' in an embodiment of a color image encryption method in accordance with the invention;
fig. 10 is a schematic diagram of a scrambling matrix S in an embodiment of a color image encryption method according to the present invention.
Detailed Description
The concept and technical effects of the present invention will be clearly and completely described below in conjunction with the embodiments to fully understand the objects, features and effects of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments, and those skilled in the art can obtain other embodiments without inventive effort based on the embodiments of the present invention, and all embodiments are within the protection scope of the present invention.
In the description of the present invention, if an orientation description is referred to, for example, the orientations or positional relationships indicated by "upper", "lower", "front", "rear", "left", "right", etc. are based on the orientations or positional relationships shown in the drawings, only for convenience of describing the present invention and simplifying the description, but not for indicating or implying that the referred device or element must have a specific orientation, be constructed and operated in a specific orientation, and thus should not be construed as limiting the present invention. If a feature is referred to as being "disposed," "secured," "connected," or "mounted" to another feature, it can be directly disposed, secured, or connected to the other feature or indirectly disposed, secured, connected, or mounted to the other feature.
In the description of the embodiments of the present invention, if "a number" is referred to, it means one or more, if "a plurality" is referred to, it means two or more, if "greater than", "less than" or "more than" is referred to, it is understood that the number is not included, and if "greater than", "lower" or "inner" is referred to, it is understood that the number is included. If reference is made to "first" or "second", this should be understood to distinguish between features and not to indicate or imply relative importance or to implicitly indicate the number of indicated features or to implicitly indicate the precedence of the indicated features.
Referring to fig. 1, a flowchart of an embodiment of a color image encryption method according to an embodiment of the present invention is shown. The method specifically comprises the following steps:
s101, a matrix extraction step, namely extracting a pixel matrix P of the color image;
s103, a cross-plane scrambling step, namely inputting the pixel matrix P into a first preset model, and scrambling elements in the pixel matrix P to obtain a scrambling matrix S;
and S105, a non-sequential diffusion step, namely inputting the scrambling matrix S into a second preset model, changing element values in the scrambling matrix and outputting a result matrix C.
In a traditional color picture encryption mode, R, G, B color planes are separated, the three planes are encrypted independently, and finally the three encryption results are combined together to form a color encrypted image, so that the security level is low, or R, G and B color planes are combined into a gray image three times the size of an original color image, and then the gray image is encrypted to obtain an encryption result, and the encryption strategy may cause low encryption efficiency. Therefore, when encrypting a color image, most existing encryption strategies treat the color image as a grayscale image and do not consider utilizing the characteristics of the color image.
The embodiment fully considers the inherent characteristics of the color image, and rapidly and simultaneously changes all pixel positions and pixel values of three color planes of the color image through a cross-plane scrambling step and a non-sequential diffusion step, thereby achieving good encryption effect and high security.
Referring to fig. 2, in another embodiment, the method further includes a step S102 of blurring surrounding pixels and inserting random noise into the color image to increase the complexity of cracking. Specifically, random noise is added to edge pixels in a preset color plane of the color image, and referring to fig. 3, some random noise is added by selecting preset bits (in this embodiment, the last two bits converted into a two-level system representation) of values of pixels (R11, R12, R13, R21, R23, R31, R32, R33) at the edge of the red plane picture.
Since surrounding pixels of a natural image usually contain much less visual information than the middle pixels, this operation only changes little information of the color image and hardly affects the visual effect. In addition, compared with the more significant bit of the pixel, the less significant bit of the pixel only contains little information of the pixel, and even if the pixel itself is hardly influenced, the cracking difficulty can be effectively increased.
Referring to fig. 4, in other embodiments, to improve the difficulty of cracking, the method further includes the steps of:
s107, a cross-plane scrambling step;
s109, a non-sequential diffusion step;
and further performing cross-plane scrambling and non-sequential diffusion on the color picture to improve the safety of the picture.
In some embodiments, the color picture is converted into an RGB pixel matrix P, and the RGB pixel matrix P is encrypted, specifically:
generating a chaotic sequence L through a preset function, such as a logistic chaotic function, wherein the length of the chaotic sequence L is M × N × 3+3(M + N);
rearranging the chaotic sequence L into a three-dimensional chaotic matrix A, a two-dimensional chaotic matrix B and a two-dimensional chaotic matrix C, wherein the size of the three-dimensional chaotic matrix is M × N × 3, the size of the two-dimensional chaotic matrix B is 3 × M, and the size of the two-dimensional chaotic matrix C is 3 × N;
sorting the three-dimensional chaotic matrix A according to the size of the preset dimension element values, as shown in figure 5, sorting the three-dimensional chaotic matrix A according to the corresponding values of the third dimension (A (: 1,1,1), A (: 2,2) and A (: 3)) in an ascending order, and obtaining a three-dimensional index matrix I;
sorting the two-dimensional chaotic matrix B according to the size of a preset dimension element value to obtain a two-dimensional index matrix T, and as shown in FIG. 6, sorting the two-dimensional chaotic matrix B according to the ascending order of row vectors to obtain a two-dimensional index matrix T;
sorting the two-dimensional chaotic matrix C according to the size of a preset dimension element value to obtain a two-dimensional index matrix Q, and as shown in FIG. 7, sorting the two-dimensional chaotic matrix C according to the ascending order of row vectors to obtain a two-dimensional index matrix Q;
calculating a first index matrix J from said two-dimensional index matrix T, wherein J (i, m, k) ═ Q (k)jWherein i ∈ {1 … M }, M ═ j-T (k)i-1) modN) +1, k ∈ {1,2,3}, j ∈ {1 … N }, as shown in fig. 8;
adjusting the element values in the pixel matrix P by the three-dimensional index matrix I, and obtaining a second pixel matrix P ', specifically P' (I, j, k) ═ P (I, j, I (I, j, k)), where I ∈ {1 … M }, j ∈ {1 … N }, k ∈ {1 … 3}, as shown in fig. 9;
the positions of elements in the second pixel matrix P ' are scrambled by the first index matrix J to obtain a scrambling matrix S, specifically, S (m, n, k) ═ P ' (r, c, k), where r ═ i, c ═ J (i, J, k), m ═ J (1, J, k) -1) modM) +1, n ═ J (m, J, k), i ∈ {1,2,3}, where M, N is the number of rows and columns of the second pixel matrix P ', respectively.
Referring specifically to FIG. 10, since the 1 st column of J (: 1) is {1,2,4,3}TCoordinates are combined with the line numbers, respectively, and the pixels at positions (1,1), (2,2), (3,4) and (4,3), i.e., pixels B1, R6, B12 and G15, in the first color plane P' are selected and cyclically shifted up by J (1,1,1) ═ 1 pixel position. Then, S (1,1,1) ═ R6, S (2,2,1) ═ B12, S (3,4,1) ═ G15, and S (4,3,1) ═ B1 can be obtained.
Since the 2 nd column of J (: 1) is {3, 1,2, 4}TThe coordinates are combined with the row number, respectively, and the pixels at positions (1,3), (2,1), (3,2) and (4,4), i.e., pixels G3, B5, B10 and B16, in the first color plane P' are selected and cyclically shifted up by J (1,2,1) ═ 3 pixel positions. Then, S (1,3,1) ═ B16, S (2,1,1) ═ G3, S (3,2,1) ═ B5, and S (4,4,1) ═ B10 can be obtained.
Since the 3 rd column of J (: 1) is {4,3, 1, 2}TCoordinates are combined with the line numbers, respectively, and the pixels at positions (1,4), (2,3), (3,1) and (4,2), i.e., pixels G4, R7, R9 and G14, in the first color plane P' are selected and cyclically shifted up by J (1,3,1) ═ 4 pixel positions. Then, S (1,4,1) ═ G4, S (2,3,1) ═ R7, S (3,1,1) ═ R9, and S (4,2,1) ═ G14 can be obtained.
Since the 4 th column of J (: 1) is {2, 4,3, 1}TThe coordinates are combined with the row number, and the pixels at positions (1,2), (2,4), (3,3) and (4,1), i.e., pixels R2, G8, G11 and R13, in the first color plane P' are selected and cyclically moved up by J (1,4,1) 2 pixel positions, resulting in S (1,2,1) G11, S (2,4,1) R13, S (3,3,1) R2, and S (4,1,1) G8.
Likewise, the second and third color planes in P' are shifted using the index matrices J (: i, 2) and J (: i, 3), respectively.
By the above replacement, the scrambling matrix S is caused to change the positions of the pixels as compared with the original color image P.
After the color image is scrambled, a non-sequential diffusion step is further performed on the color image, the scrambling matrix S is input into a second preset model, the element values in the scrambling matrix are changed, and the output result matrix C specifically comprises:
if i is 1, j is 1, and k is 1, then Ci,j,k＝(Si,j,k+SM,N,3+Ai,j.k)modF，
If i is 1, j is 1, and k is not equal to 1, Ci,j,k＝(Si,j,k+CM,N,k-1+Ai,j.k)modF；
If i is 1, j is not equal to 1, Ci,j,k＝(Si,j,k+CM,j-1,k+Ai,j.k)modF；
If i ≠ 1, then Ci,j,k＝(Si,j,k+Ci-1,j,k+Ai,j.k)modF
M, N denotes the number of rows and columns of the pixel matrix P, a denotes the three-dimensional chaotic matrix, i ∈ {1 … M }, j ∈ {1 … N }, k ∈ {1 … 3}, F denotes a maximum value that can be taken by an element in the pixel matrix P, and if a pixel in P is represented by 8 bits, F denotes 256.
All the steps are reversible operation, and decryption can be realized only by realizing the inverse operation of the operation, so that the original color image is restored.
In this embodiment, it is possible to simultaneously change the positions and change the pixel values for the pixels on the three color planes of the color image. Through test and verification, better encryption effect and higher safety can be achieved, and various forms of attacks can be resisted.
An embodiment of the present invention provides a color image encryption apparatus including:
the matrix extraction module is used for extracting a pixel matrix P of the color image;
the cross-plane scrambling module inputs the pixel matrix into a first preset model, and scrambles elements in the pixel matrix P to obtain a scrambling matrix S;
and the non-sequential diffusion module is used for inputting the scrambling matrix S into a second preset model, changing the element values in the scrambling matrix and outputting a result matrix C.
One embodiment of the present invention provides a computer-readable storage medium: the method comprises the following steps: the computer-readable storage medium stores computer-executable instructions for causing a computer to perform the color image encryption method.
The embodiments of the present invention have been described in detail with reference to the accompanying drawings, but the present invention is not limited to the above embodiments, and various changes can be made within the knowledge of those skilled in the art without departing from the gist of the present invention. Furthermore, the embodiments of the present invention and the features of the embodiments may be combined with each other without conflict.
Claims (9)
1. A color image encryption method, comprising:
a matrix extraction step of extracting a pixel matrix P of the color image;
a cross-plane scrambling step, namely inputting the pixel matrix P into a first preset model, and scrambling elements in the pixel matrix P to obtain a scrambling matrix S;
and a non-sequential diffusion step, namely inputting the scrambling matrix S into a second preset model, changing element values in the scrambling matrix and outputting a result matrix C.
2. A color image encryption method according to claim 1, characterized in that said pixel matrix P is an RGB matrix.
3. The color image encryption method according to claim 1, wherein the cross-plane scrambling step inputs the pixel matrix P into a first preset model, and scrambles elements in the pixel matrix P to obtain a scrambling matrix, including:
generating a chaotic sequence L through a preset function;
rearranging the chaotic sequence L into a three-dimensional chaotic matrix A, a two-dimensional chaotic matrix B and a two-dimensional chaotic matrix C;
sequencing the three-dimensional chaotic matrix A according to the size of a preset dimension element value to obtain a three-dimensional index matrix I;
sequencing the two-dimensional chaotic matrix B according to the size of a preset dimension element value to obtain a two-dimensional index matrix T;
sorting the two-dimensional chaotic matrix C according to the size of a preset dimension element value to obtain a two-dimensional index matrix Q;
calculating a first index matrix J from said two-dimensional index matrix T, wherein J (i, m, k) ═ Q (k)jWherein i ∈ {1 … M }, M ═ j-T (k)i-1)mod N)+1，k∈{1,2,3}，j∈{1…N}；
Adjusting element values in the pixel matrix P by the three-dimensional index matrix I, and obtaining a second pixel matrix P ', specifically P' (I, j, k) ═ P (I, j, I (I, j, k)), where I ∈ {1 … M }, j ∈ {1 … N }, k ∈ {1 … 3 };
scrambling the positions of the elements in the second pixel matrix P 'by the first index matrix J to obtain a scrambling matrix S, specifically S (m, n, k) ═ P' (r, c, k), where r ═ i, c ═ J (i, J, k), m ═ J (1, J, k) -1) modM) +1, n ═ J (m, J, k), i ∈ {1,2,3 };
m, N denotes the number of rows and columns of the pixel matrix P, respectively.
4. A color image encryption method according to claim 3, characterized in that said predetermined function is a logistic chaotic function.
5. The color image encryption method according to claim 3, wherein in the non-sequential diffusion step, the scrambling matrix S is input to a second preset model, the element values in the scrambling matrix are changed, and the output result matrix C specifically comprises:
if i is 1, j is 1, and k is 1, then Ci,j,k＝(Si,j,k+SM,N,3+Ai,j.k)mod F，
If i is 1, j is 1, and k is not equal to 1, Ci,j,k＝(Si,j,k+CM,N,k-1+Ai,j.k)mod F；
If i is 1, j is not equal to 1, Ci,j,k＝(Si,j,k+CM,j-1,k+Ai,j.k)mod F；
If i ≠ 1, then Ci,j,k＝(Si,j,k+Ci-1,j,k+Ai,j.k)mod F
M, N respectively represents the number of rows and columns of the pixel matrix P, A represents the three-dimensional chaotic matrix, i ∈ {1 … M }, j ∈ {1 … N }, k ∈ {1 … 3} and F represents the maximum value of the values of the elements in the pixel matrix P.
6. The color image encryption method according to claim 1, further comprising: and a surrounding pixel blurring step, wherein random noise is inserted into the color image.
7. The method of claim 6, wherein said inserting random noise into the color image comprises: and adding random noise into preset bits of edge pixels in a preset color plane of the color image.
8. A color image encryption apparatus, comprising:
the matrix extraction module is used for extracting a pixel matrix P of the color image;
the cross-plane scrambling module inputs the pixel matrix P into a first preset model, and scrambles elements in the pixel matrix P to obtain a scrambling matrix S;
and the non-sequential diffusion module is used for inputting the scrambling matrix S into a second preset model, changing the element values in the scrambling matrix and outputting a result matrix C.
9. A computer-readable storage medium storing computer-executable instructions for causing a computer to perform the color image encryption method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010194956.5A CN111479032B (en) | 2020-03-19 | 2020-03-19 | Color image encryption method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010194956.5A CN111479032B (en) | 2020-03-19 | 2020-03-19 | Color image encryption method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111479032A true CN111479032A (en) | 2020-07-31 |
| CN111479032B CN111479032B (en) | 2022-05-31 |
Family
ID=71747587
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010194956.5A Active CN111479032B (en) | 2020-03-19 | 2020-03-19 | Color image encryption method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111479032B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982499A (en) * | 2012-09-28 | 2013-03-20 | 河南大学 | Color image encryption and decryption method based on multiple-fractional-order chaotic systems |
| CN103179319A (en) * | 2013-01-09 | 2013-06-26 | 王少夫 | Method for encrypting digital images of double-chaos system |
| CN104182926A (en) * | 2014-07-25 | 2014-12-03 | 南京邮电大学 | Color image encryption method based on Hilbert transform and chaos Liu algorithm |
| CN105118017A (en) * | 2015-08-06 | 2015-12-02 | 河海大学 | Gray image encryption method based on two-dimension Henon mapping |
| CN106296560A (en) * | 2016-07-29 | 2017-01-04 | 广东工业大学 | A kind of multicolor image encryption algorithm of complex cascade chaos |
-
2020
- 2020-03-19 CN CN202010194956.5A patent/CN111479032B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982499A (en) * | 2012-09-28 | 2013-03-20 | 河南大学 | Color image encryption and decryption method based on multiple-fractional-order chaotic systems |
| CN103179319A (en) * | 2013-01-09 | 2013-06-26 | 王少夫 | Method for encrypting digital images of double-chaos system |
| CN104182926A (en) * | 2014-07-25 | 2014-12-03 | 南京邮电大学 | Color image encryption method based on Hilbert transform and chaos Liu algorithm |
| CN105118017A (en) * | 2015-08-06 | 2015-12-02 | 河海大学 | Gray image encryption method based on two-dimension Henon mapping |
| CN106296560A (en) * | 2016-07-29 | 2017-01-04 | 广东工业大学 | A kind of multicolor image encryption algorithm of complex cascade chaos |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111479032B (en) | 2022-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102982499B (en) | Based on color image encryption and the decryption method of multi-fractional order chaos system | |
| Samiullah et al. | An image encryption scheme based on DNA computing and multiple chaotic systems | |
| US7324662B2 (en) | Method, software, and device for hiding data in binary image, while preserving image quality | |
| CN104200424B (en) | Difference conversion based (K, N) meaningful image sharing and recovering method | |
| CN111461951B (en) | Color image encryption method, apparatus, computer device, and readable storage medium | |
| CN108199828B (en) | Method and device for encrypting color picture | |
| CN106558015B (en) | Novel cross composite chaotic color image encryption algorithm | |
| Zhang et al. | Color image encryption algorithm based on 3D Zigzag transformation and view planes | |
| Kanwal et al. | Analytic study of a novel color image encryption method based on the chaos system and color codes | |
| CN110535624A (en) | A kind of medical image method for secret protection applied to DICOM format | |
| CN109618073A (en) | A kind of more figure encryption methods based on Hyperchaotic Chen System | |
| Yampolskiy et al. | Password protected visual cryptography via cellular automaton rule 30 | |
| Razzaque et al. | An efficient S-box design scheme for image encryption based on the combination of a coset graph and a matrix transformer | |
| Alshehri et al. | Cryptanalysis of 2D-SCMCI Hyperchaotic Map Based Image Encryption Algorithm. | |
| CN113992810A (en) | Agile image encryption method based on deep learning | |
| CN113259089A (en) | Image encryption method based on combination of chaos principle and genetic algorithm | |
| CN104348611B (en) | Melt file in the camouflage encryption method of image | |
| CN111479032B (en) | Color image encryption method, device and storage medium | |
| Kumar et al. | A secured cryptographic model using intertwining logistic map | |
| CN115883744B (en) | Watermarking method and device based on fractional order chaotic mapping and storage medium | |
| Tabash et al. | Image encryption algorithm based on chaotic map | |
| Allawi | Image encryption based on chaotic mapping and random numbers | |
| Lin et al. | A batch image encryption scheme based on chaining random grids | |
| Krasilenko et al. | The block parametric matrix affine-permutation ciphers (BP_MAPCs) with isomorphic representations and their research | |
| Brindha | Periodicity analysis of Arnold Cat Map and its application to image encryption |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |