Multi-image scrambling method based on whack model

Abstract

The invention discloses a multi-image scrambling method based on a whack-a-mole model, and belongs to the field of image security. In many fields, a large number of images are generated every day. In order to protect multi-image information from being stolen and improve the security and efficiency of image content network transmission, the invention designs a multi-image scrambling method based on a whack-a-mole model. The method comprises the following steps: firstly, stacking k original images together to form a three-dimensional matrix; secondly, generating three chaotic sequences by utilizing Logistic mapping, and performing integer processing and matrix processing; thirdly, establishing a whack model for image scrambling, and finally, performing scrambling operation on the three-dimensional matrix by adopting the established whack model to generate k encrypted images. Experimental results show that the new method achieves a good effect in the aspect of security, and is beneficial to improving the security of image content network transmission.

Description

Technical Field

[0001] The present invention relates to an information encryption technology, in particular to an image encryption method. Background Art

[0002] In many fields, a huge amount of digital images are generated every day, such as military reconnaissance, natural disaster monitoring, traffic monitoring, weather forecasting, e-government, and personal affairs. At the same time, the emergence of a large number of various shooting devices in recent years has also accelerated the arrival of the big data era. For example, an ordinary SLR camera can capture 3 to 5 images per second, and a traffic camera can collect thousands of images every day. In the era of big data, digital images often carry a lot of secret information. With the rapid development of computers and the Internet, multimedia security, especially image security, has become one of the important challenges in academia and industry.

[0003] In recent years, people have paid more and more attention to the security of networks and information systems. Due to the openness of the Internet, information can be easily intercepted or leaked during network transmission. Therefore, it is very important to effectively and securely protect the content security of multiple images. As a new multimedia security technology, multiple-image encryption (MIE) has the characteristics of high efficiency and has gradually attracted people's attention. At present, researchers have proposed some multi-image encryption methods, but their encryption efficiency is low or the security is weak, which is difficult to be satisfactory. In order to improve the security of multi-image encryption methods and ensure the secure transmission of digital images, a multi-image scrambling method based on the whack-a-mole model is designed. Summary of the invention

[0004] The purpose of the present invention is to propose a multi-image scrambling method based on the whack-a-mole model in view of the problems of low encryption efficiency or weak security in existing multi-image encryption methods.

[0005] Technical solution of the present invention: To achieve the above-mentioned purpose of the invention, the technical solution adopted is a multi-image scrambling method based on the whack-a-mole model, and the steps are described in detail as follows: Step 1: Image dimension conversion: Let k The size is m × n Gray image I 1, I 2, …, I k The original image set ， according to I 1, I 2, …, I k The order of the stacking, they are stacked together to form a m × n× k The three-dimensional matrix S 1 ; Step 2: Generate chaotic sequence: Logistic mapping is: x t+1 = rx t (1- x t ), (1) in, r ∈ [3.57, 4) is the control parameter, x t ∈ (0, 1); randomly select control parameter values r 1 and initial value x 0, iterate using formula (1) mk times, we can get a length of mk Chaotic sequence X 1 ={ x 1 i}, i =1, 2, …, mk ; Randomly select control parameter values r 2 and initial value y 0, iterate using formula (1) n times, we can get a length of n Chaotic sequence Y 1 ={ y 1 j}, j =1, 2, …, n ; Randomly select control parameter values r 3 and initial value z 0, iterate using formula (1) mn times, we can get a length of mn The chaotic sequence Z 1 ={ z 1 q}, q =1, 2, …, mn ; Step 3: Integerization of chaotic sequence: Using formulas (2), (3) and (4), we can respectively X 1 , Y 1 , Z 1 After integer processing, we can get three lengths: mk , n , mn Integer chaotic sequence X 2 ={ x 2 i}, Y 2 ={ y 2 j}, Z 2 ={ z 2 q}, x 2 i = mod [ floor ( x 1 i ×10 15 ), n ]+1, (2) y 2 j = mod [ floor ( y 1 j ×10 15 ), m ]+1, (3) z 2 q = mod [ floor ( z 1 q ×10 15 ), k ]+1, (4) in, i =1, 2, …, mk ; j =1, 2, …, n ; q =1, 2, …, mn ; x 1 i ∈ X 1 , x 2 i ∈ X 2 , y 1j ∈ Y 1 , y 2 j ∈ Y 2 , z 1 q ∈ Z 1 , z 2 q ∈ Z 2 , floor (•) is the floor function, mod (•) is the modulo function ; Step 4: Matrix the chaotic sequence: Matrix the integer chaotic sequence according to the order of elements from top to bottom and from left to right. X 2 , Y 2 , Z 2 Converted into 3 sizes respectively: m × k , n × k , m × n The two-dimensional chaotic matrix C 1 =[ c 1 uw ], C 2 =[ c 2 vw ], C 3 =[ c 3 uv ];in, u =1, 2, …, m ; v =1, 2, …, n ; w =1, 2, …, k ; Step 5: Whack-a-Mole model scrambling: from cube structure analysis, three-dimensional matrix S 1 There are 6 faces in total: top, bottom, left, right, front and back. S 1 The pixel values ​​in are regarded as hamsters, and the three-dimensional matrix S1 The Whack-a-Mole model is established as follows: S 1 The top and bottom directions of each pixel in the above n pixel values, and then c 1 uw ∈ C 1 The circular shift operation of elements can obtain a m × n × k The three-dimensional matrix S 2 ;exist S 2 The left and right directions of each pixel on the left are m pixel values, move left c 2 vw ∈ C 2 The circular shift operation of elements can obtain a m × n × k The three-dimensional matrix S 3 ;exist S 3 The front and back directions of each pixel in the front are k pixel values, forward c 3 uv ∈ C 3 The circular shift operation of elements can obtain a m × n × k The three-dimensional matrix S 4 ;in, u =1, 2, …, m ; v =1, 2, …, n ; w =1, 2, …, k ; Step 6: Generate encrypted image: S 4 Split into k The size is m × n Image E 1,E 2, …, E k , that is k Encrypted image.

[0006] Beneficial effects: In order to protect image information from being stolen and improve the security and efficiency of image content network transmission, a multi-image scrambling method based on the Whack-a-Mole model is proposed. The main contributions are as follows: (1) A Whack-a-Mole model is designed for image scrambling; (2) Using the designed Whack-a-Mole model, a multi-image scrambling method based on the Whack-a-Mole model is proposed to realize the scrambling operation of the original image; (3) Experimental results show that the multi-image scrambling method based on the Whack-a-Mole model has achieved good results in terms of visual effect, scrambling degree and encryption efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0007] Figure 1 :Flowchart of multi-image scrambling based on whack-a-mole model; Figure 2 : Original image Baboon; Figure 3 : original image Flower; Figure 4 : Original image Fruits; Figure 5 : Original image Pens; Figure 6 : Encrypted image Baboon; Figure 7 : Encrypted image Flower; Figure 8 : Encrypted image Fruits; Fig. 9 : Encrypted Image Pens. Implementation

[0008] The implementation process of the present invention is further described in detail below with reference to specific drawings and examples.

[0009] Figure 1 It is a flowchart of the multi-image scrambling method based on the whack-a-mole model.

[0010] The programming software used is Matlab R2023a, and the Figure 2 (Original image Baboon), Figure 3 (Original image Flower), Figure 4 (Original image Fruits) and Figure 5 The four grayscale images shown in (Original Image Pens) with a size of 512×480 are used as experimental objects.

[0011] The multi-image scrambling method based on the whack-a-mole model, the scrambling process steps are detailed as follows: Step 1: Image dimension conversion: Let 4 gray images of size 512×480 I 1, I 2, I 3, I 4 The original image set ， according to I 1, I 2, I 3, I 4 In order, stack them together to form a three-dimensional matrix of size 512×480×4 S 1 ; Step 2: Generate chaotic sequence: randomly select control parameter values r 1=3.7235 and initial value x 0=0.6318, using formula (1) and iterating 2048 times, we can get a chaotic sequence with a length of 2048. X 1 ={ x 1 i}, i =1, 2, …, 2048; randomly select control parameter values r 2=3.8428 and initial value y 0=0.3361, using formula (1) and iterating 1920 times, we can get a chaotic sequence with a length of 1920 Y 1 ={ y 1 j}, j =1, 2, …, 1920; randomly select control parameter values r 3 = 3.8462 and the initial value z 0=0.6295, using formula (1) and iterating 245760 times, we can get a chaotic sequence Z with a length of 245760. 1 ={ z 1 q}, q =1, 2,…, 245760; Step 3: Integerization of chaotic sequence: Using formulas (2), (3) and (4), we can respectively X 1 , Y 1 , Z 1After integer processing, we can get three integer chaotic sequences with lengths of 2048, 1920, and 245760 respectively. X 2 ={ x 2 i}, Y 2 ={ y 2 j}, Z 2 ={ z 2 q} ; Step 4: Matrix the chaotic sequence: Matrix the integer chaotic sequence according to the order of elements from top to bottom and from left to right. X 2 , Y 2 , Z 2 Converted into three two-dimensional chaotic matrices of size 512×4, 480×4, 512×480 respectively C 1 =[ c 1 uw ], C 2 =[ c 2 vw ], C 3 =[ c 3 uv ];in, u =1, 2, …, 512; v =1, 2, …, 480; w =1, 2, …, 4; Step 5: Whack-a-Mole model scrambling: from cube structure analysis, three-dimensional matrix S 1 There are 6 faces in total: top, bottom, left, right, front and back. S 1 The pixel values ​​in are regarded as hamsters, and the three-dimensional matrix S 1 The Whack-a-Mole model is established as follows: S 1For the 480 pixel values ​​in the up and down directions of each pixel in the above, perform an upward calculation. c 1 uw ∈ C 1 The circular shift operation of elements can obtain a three-dimensional matrix of size 512×480×4 S 2 ;exist S 2 In the left and right directions of the left and right directions of each pixel on the left, the 512 pixel values ​​in the left and right directions of each pixel on the left are moved to the left. c 2 vw ∈ C 2 The circular shift operation of elements can obtain a three-dimensional matrix of size 512×480×4 S 3 ;exist S 3 The front and back directions of each pixel in the front are forwarded. c 3 uv ∈ C 3 The circular shift operation of elements can obtain a three-dimensional matrix of size 512×480×4 S 4 ;in, u =1, 2, …, 512; v =1, 2, …, 480; w =1, 2, …, 4; Step 6: Generate encrypted image: S 4 Split into 4 images of 512×480 each E 1, E 2, E 3, E 4, that is, 4 encrypted images, such as Figure 6 , Figure 7 , Figure 8 and Fig. 9 shown.

Claims

1. A multi-image scrambling method based on the whack-a-mole model, characterized in that: The scrambling process includes the following steps: Step 1: Image dimension conversion: Let k The size is m × n Gray image I 1, I 2, …, I k The original image set ， according to I 1, I 2, …, I k The order of the stacking, they are stacked together to form a m × n × k The three-dimensional matrix S 1 ; Step 2: Generate chaotic sequence: Logistic mapping is: x t+1 = rx t (1- x t )， （1） in, r ∈ [3.57, 4) is the control parameter, x t ∈ (0, 1); randomly select control parameter values r 1 and initial value x 0, iterate using formula (1) mk times, we can get a length of mk Chaotic sequence X 1 ={ x 1 i }, i =1, 2, …, mk ; Randomly select control parameter values r 2 and initial value y 0, iterate using formula (1) n times, we can get a length of n Chaotic sequence Y 1 ={ y 1 j }, j =1, 2, …, n ; Randomly select control parameter values r 3 and initial value z 0, iterate using formula (1) mn times, we can get a length of mn The chaotic sequence Z 1 ={ z 1 q }, q =1, 2, …, mn ; Step 3: Integerization of chaotic sequence: Using formulas (2), (3) and (4), we can respectively X 1 , Y 1 , Z 1 After integer processing, we can get three lengths: mk , n , mn Integer chaotic sequence X 2 ={ x 2 i }, Y 2 ={ y 2 j }, Z 2 ={ z 2 q }, x 2 i = mod [ floor ( x 1 i ×10 15 ), n ]+1， （2） y 2 j = mod [ floor ( y 1 j ×10 15 ), m ]+1， （3） z 2 q = mod [ floor ( z 1 q ×10 15 ), k ]+1， （4） in, i =1, 2, …, mk ; j =1, 2, …, n ; q =1, 2, …, mn ; x 1 i ∈ X 1 , x 2 i ∈ X 2 , y 1 j ∈ Y 1 , y 2 j ∈ Y 2 , z 1 q ∈ Z 1 , z 2 q ∈ Z 2 , floor (•) is the floor function, mod (•) is the modulo function; Step 4: Matrix the chaotic sequence: Matrix the integer chaotic sequence according to the order of elements from top to bottom and from left to right. X 2 , Y 2 , Z 2 Converted into 3 sizes respectively: m × k , n × k , m × n The two-dimensional chaotic matrix C 1 =[ c 1 uw ], C 2 =[ c 2 vw ], C 3 =[ c 3 uv ];in, u =1, 2, …, m ; v =1, 2, …, n ; w =1, 2, …, k ; Step 5: Whack-a-Mole model scrambling: from cube structure analysis, three-dimensional matrix S 1 There are 6 faces in total: top, bottom, left, right, front and back. S 1 The pixel values ​​in are regarded as hamsters, and the three-dimensional matrix S 1 The Whack-a-Mole model is established as follows: S 1 The top and bottom directions of each pixel in the above n pixel values, and then c 1 uw ∈ C 1 The circular shift operation of elements can obtain a m × n × k The three-dimensional matrix S 2 ;exist S 2 The left and right directions of each pixel on the left are m pixel values, move left c 2 vw ∈ C 2 The circular shift operation of elements can obtain a m × n × k The three-dimensional matrix S 3 ;exist S 3 The front and back directions of each pixel in the front are k pixel values, forward c 3 uv ∈ C 3 The circular shift operation of elements can obtain a m × n × k The three-dimensional matrix S 4 ;in, u =1, 2, …, m ; v =1, 2,…, n ; w =1, 2, …, k ； Step 6: Generate encrypted image: S 4 Split into k The size is m × n Image E 1, E 2, …, E k , that is k Encrypted image.

Images