A Color Image Encryption Method Based on Jigsaw Strategy and Chaotic System
A chaotic system and color image technology, applied in the field of image processing, can solve the problem of insufficient image anti-attack ability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0047] The flow of the encryption algorithm is as follows:
[0048] 1) Convert the color image to its R, G, B component matrix, the length is M*N and the value range is (0, 255).
[0049]2) The three component matrices are formed into a two-dimensional matrix rgb with 3 rows of M*N columns as shown in Table 2. The first row of the matrix rgb is composed of pixels of R; the second row is composed of pixels of G; The three rows are made up of B's pixels.
[0050] Table 2 Pixel component distribution of two-dimensional array rgb
[0051]
[0052] 3) Calculate the image pixel sum according to formula (6), and also calculate the sum rsum, gsum, and bsum of the pixel values of the three component matrices respectively.
[0053]
[0054] 4) Iterative formula (1) obtains all the parameters required by the algorithm, and its initial value is generated by formula (4), but the hash value should be obtained by using the sum of pixel values and formula (3) in advance, borrowi...
Embodiment 2
[0083] combined with Figure 5 The decryption of the present invention is explained as follows:
[0084] The encryption algorithm of the present invention is inverse, that is, image decryption is the inverse process of image encryption.
[0085] 1) The user gets the key, and uses the formula (1)-(5) described above to generate all the key sequences x i (j), i ∈ [1, MN], j ∈ [1, 12].
[0086] 2) Convert the ciphertext image into a two-dimensional integer array, and each row is its R, G, and B component matrix called Re, Ge, Be.
[0087] 3) according to d i The three components of the ciphertext image can be decoded and a scrambled image can be obtained. The Re, Ge, Be components can be converted to Rc, Gc and Bc components using the following formulas.
[0088]
[0089]
[0090]
[0091] Among them, the value of i is reduced from MN to 1. At the end of the above operation, we must obtain the correct key value according to the following formula.
[0092] Re 0 =Rc...
Embodiment 3
[0102] combine Image 6 And list data to analyze the algorithm as follows:
[0103] exist Image 6 Among them, (a) represents the original color image, (b) represents the scrambled color image, (c) represents the encrypted color image, (d) represents the R component of the encrypted color image, and (e) represents the encrypted The G component of the color image, (f) represents the B component of the encrypted color image.
[0104] Table 3 information entropy
[0105]
[0106] Table 4 Correlation of adjacent pixels
[0107]
[0108] Table 5 NPCR and UACI values and comparison of ciphertext image when the plaintext image changes one bit
[0109]
[0110]
[0111] Table 6 Comparison with recent encryption algorithms
[0112]
[0113]The more regular a system is, the smaller its information entropy is, and vice versa, the more chaotic it is, the greater it will be. The information entropy in Table 3 is all close to 8 to illustrate that the image after encry...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


