3D multi-image encryption method and system based on poker and rubik's cube model

Abstract

The application provides a 3D multi-image encryption method and system based on a poker and Rubik's cube model, relates to the technical field of multi-image encryption, and specifically comprises the following steps: obtaining a plurality of plaintext images to be encrypted, constructing a 3D cube through block division and stacking operation, generating an operation sequence and a 3D key for the constructed 3D cube by using a SHA function and an interlaced Logistic mapping, performing plane rotation and shuffling on the constructed 3D cube based on the poker and Rubik's cube model according to the generated operation sequence to obtain a disturbed cube, performing bit-by-bit XOR operation on the disturbed cube and the 3D key to obtain a cipher cube, and expanding the cipher cube to generate a plurality of ciphertext images. The application combines chaos and a SHA function to realize a new 3D multi-image encryption scheme, fully disturbs pixels with small time consumption, has strong pixel scrambling capability and low time consumption, and effectively protects image security in a high-efficiency and effective manner.

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of multi-image encryption, and particularly relates to a 3D multi-image encryption method and system based on a poker and Rubik's cube model. BACKGROUND

[0002] The statements in this section merely provide background information related to the present application and do not necessarily constitute the prior art.

[0003] With the development of science and technology and the improvement of people's living standards, the security protection of a large number of images and high-resolution images has become a problem. Traditional cryptography methods are difficult to efficiently process a large amount of data, and the efficiency of single-image encryption methods in batch encryption is also difficult to meet the demand. The birth of multi-image encryption methods greatly improves the encryption efficiency, and the combination of cross-image encryption operations further increases the decryption difficulty. However, the existing multi-image encryption methods are often accompanied by insufficient pixel disturbance, resulting in insufficient pixel scrambling ability and large time overhead, which affects the effect of multi-image encryption. SUMMARY

[0004] In order to overcome the shortcomings of the prior art, the present application provides a 3D multi-image encryption method and system based on a poker and Rubik's cube model, which combines chaos and SHA functions to realize a new 3D multi-image encryption scheme. The pixel is disturbed sufficiently with small time overhead, and the pixel scrambling ability is strong while the time overhead is low, so as to efficiently and effectively protect the image security.

[0005] To achieve the above object, one or more embodiments of the present application provide the following technical solutions:

[0006] The first aspect of the present application provides a 3D multi-image encryption method based on a poker and Rubik's cube model;

[0007] The 3D multi-image encryption method based on a poker and Rubik's cube model comprises:

[0008] Obtaining a plurality of plaintext images to be encrypted, constructing a 3D cube through blocking and stacking operations;

[0009] Generating an operation sequence and a 3D key for the constructed 3D cube using SHA function and interlaced Logistic mapping;

[0010] According to the generated operation sequence, performing plane rotation and shuffling on the constructed 3D cube based on the poker and Rubik's cube model to obtain a disturbance cube;

[0011] XORing the disturbance cube and the 3D key bit by bit to obtain a cipher cube, and expanding the cipher cube to generate a plurality of ciphertext images.

[0012] Further, the operation sequence and the 3D key for the constructed 3D cube are generated, specifically:

[0013] SHA256 is calculated for the 3D cube, and the obtained hash value is XORed with a pre-selected 256-bit binary user key to obtain a 256-bit binary number;

[0014] A 32-length decimal array is generated using the obtained binary number, and the parameters and initial values of the interwoven Logistic mapping are calculated;

[0015] The parameters and initial values are subjected to interwoven Logistic mapping to obtain a chaotic sequence;

[0016] Based on the chaotic sequence, an operation sequence and a 3D key are generated.

[0017] Further, the poker and Rubik's cube model includes a Rubik's cube rotation model and a poker shuffling model.

[0018] Further, the Rubik's cube rotation model disturbs the pixel positions by multiple iterations of rotation.

[0019] Further, the poker shuffling model disturbs the hierarchical relationship between pixels by iterative operations to achieve the crossing of the surface and the inner layer.

[0020] Further, the poker and Rubik's cube model specifically operates as follows:

[0021] (1) Place the 3D cube in a three-dimensional coordinate system, and define the x-plane, y-plane and z-plane set;

[0022] (2) Rotate the x-plane and y-plane respectively;

[0023] (3) Cut the z-plane to obtain a plurality of card decks, and rearrange the cut card decks;

[0024] (4) Iteratively execute steps (2)-(3) until the number of iterations is satisfied, and finally obtain a disturbed cube.

[0025] Further, the x-plane: the set of all pixel points with a fixed value a of x coordinate is the a-th x-plane;

[0026] The y-plane: the set of all pixel points with a fixed value b of y coordinate is the b-th y-plane; and the z-plane: the set of all pixel points with a fixed value c of z coordinate is the c-th z-plane.

[0027] The second aspect of the application provides a 3D multi-image encryption system based on a poker and Rubik's cube model.

[0028] The 3D multi-image encryption system based on the poker and Rubik's cube model includes a cube construction module, a key generation module, a cube disturbance module and a multi-image encryption module:

[0029] The cubic construction module is configured to acquire a plurality of plaintext images to be encrypted, and construct a 3D cube through a blocking and stacking operation.

[0030] The key generation module is configured to generate an operation sequence and a 3D key for the constructed 3D cube by using a SHA function and an interleaved Logistic mapping.

[0031] The cube scrambling module is configured to perform plane rotation and shuffling on the constructed 3D cube according to the generated operation sequence based on a poker and Rubik's cube model to obtain a scrambled cube.

[0032] The multi-image encryption module is configured to perform a bit-by-bit XOR operation between the scrambled cube and the 3D key to obtain a cipher cube, and expand the cipher cube to generate a plurality of ciphertext images.

[0033] The third aspect of the present application provides a computer readable storage medium having a program stored thereon, which, when executed by a processor, implements the steps of the 3D multi-image encryption method based on a poker and Rubik's cube model according to the first aspect of the present application.

[0034] The fourth aspect of the present application provides an electronic device comprising a memory, a processor and a program stored on the memory and executable on the processor, wherein the processor implements the steps of the 3D multi-image encryption method based on a poker and Rubik's cube model according to the first aspect of the present application when executing the program.

[0035] The above one or more technical solutions have the following beneficial effects:

[0036] The present application well balances the scrambling effect and efficiency, has high key sensitivity, low correlation and robustness, can effectively resist various attacks on image encryption, has high encryption quality, and has strong recovery ability from loss; each iteration of the present application involves a large number of pixels, and the number of iterations can be flexibly selected according to requirements, a plurality of images can be encrypted at one time, and cross-image encryption is realized, which not only improves the attack difficulty of attackers, but also improves the probability of recovering image information by the receiving party in the case of partial data loss, so that the present application can flexibly and efficiently realize the security protection of multiple images.

[0037] The advantages of the additional aspects of the present application will be partially given in the following description, partially will become obvious from the following description, or will be understood through the practice of the present application. BRIEF DESCRIPTION OF DRAWINGS

[0038] The drawings accompanying the specification of the present application serve to provide a further understanding of the present application, the illustrative embodiments of the present application and their descriptions serve to explain the present application, and do not constitute an improper limitation of the present application.

[0039] Figure 1 This is a flowchart of the method in the first embodiment.

[0040] Figure 2 This is a schematic diagram of the encryption process in the first embodiment.

[0041] Figure 3 A schematic diagram of the cube construction for the first embodiment.

[0042] Figure 4 This is a schematic diagram of the Rubik's Cube rotation model in the first embodiment.

[0043] Figure 5 This is a schematic diagram of the poker shuffling model in the first embodiment.

[0044] Figure 6 A schematic diagram of scrambling the poker and Rubik's Cube models in the first embodiment.

[0045] Figure 7 This is a schematic diagram of the z-plane rearrangement process during the scrambling in the first embodiment.

[0046] Figure 8 This is a flowchart of the decryption process for the first embodiment.

[0047] Figure 9 This is a schematic diagram of the z-plane rearrangement process for the first embodiment.

[0048] Figure 10 The image shows the simulation results of the first embodiment. Detailed Implementation

[0049] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0050] Example 1

[0051] This embodiment discloses a 3D multi-image encryption method based on playing cards and Rubik's Cube models;

[0052] like Figure 1 , Figure 2 As shown, a 3D multi-image encryption method based on playing cards and Rubik's Cube models includes:

[0053] Step S1: Obtain multiple plaintext images to be encrypted, and construct a 3D cube through block and stacking operations.

[0054] The plaintext image to be encrypted is a 2D image. Based on the size n and quantity m of the plaintext image, referring to Table 1, the size N of the 3D cube is flexibly selected to divide the 2D image into N×N small blocks. These small blocks are then stacked in order to construct a 3D cube. original , Figure 3Fig. 1 is a schematic diagram of constructing a 128x128x128 cube from 8 512x512 images.

[0055] Table 1: An example of the relationship between the number and size of input images and cubes

[0056]

[0057] Step S2: Generating the operation sequence and 3D key for the constructed 3D cube using the SHA function and the interleaved Logistic map, the specific steps are as follows:

[0058] 1. Pre-select a set of 256-bit binary numbers as the user key Key;

[0059] 2. Calculate SHA256 for the 3D cube CUBE original and XOR with the user key Key to generate a 256-bit binary number for generating the chaotic map;

[0060] 3. Convert each eight bits of the binary number generated in 2 into a decimal number to generate a 32-length decimal array H, and calculate the parameters and initial values of the interleaved Logistic map according to the following formula:

[0061] k1 = sum(H(4i-3)) / 256 + 33.5

[0062] k2 = sum(H(4i-2)) / 256 + 37.97

[0063] k3 = sum(H(4i-1)) / 256 + 35.7

[0064] μ = mod(sum(H(4i)) / 256, 3.99) + 0.009

[0065] x1 = mod((k1 x k2 x k3 / μ), 0.999)

[0066] y1 = mod((k2 x μ / (k1 x k3 x x1)), 0.999)

[0067] z1 = mod((k3 x μ x x1 / (k1 x k2 x y1)), 0.999)

[0068] Where k1, k2, k3, μ are the parameters of the interleaved Logistic map, x1, y1, z1 are its initial values, sum() is the summation function, H(n) represents the nth number of array H, and i is the number of cycles.

[0069] iv. The parameters and initial values are input into the interleaved Logistic map, and the chaotic sequences x, y, and z are obtained through iterative calculation, and the first 1000 data of x, y, and z are discarded to eliminate transient effects, wherein the interleaved Logistic map is given by the following formula:

[0070] x n+1 = mod(μ×k1×y n ×(1-x n )+z n , 1)

[0071]

[0072] z n+1 = mod(μ×(x n+1 +y n+1 +k3)×sin z n , 1)

[0073] v. The chaotic sequences x, y, and z are sorted to generate sequences u, v, and w, respectively:

[0074] [p, q] = sort(x)

[0075] [p, q] = sort(y)

[0076] [p, q] = sort(z)

[0077] wherein the function [p, q] = sort(x) represents that all values of the sequence x are sorted in ascending order and output as the sequence p, and the index of x in p is output as the sequence q, and ~ represents that the current value does not need to be output.

[0078] vi. Based on the sequences u, v, and w, the operation sequence is calculated:

[0079] A = mod(u, N) + 1

[0080] B = mod(v, N) + 1

[0081] C = mod(w, 3) + 1

[0082] vii. Based on the modulo operation, the chaotic sequence is converted into a 3D key Key 3D , specifically:

[0083] Key 3D (2i-1, 2j-1, k) = mod(floor(x(num)×2 12 ), 256)

[0084] Key 3D (2i-1, 2j, k) = mod(floor(y(num)×212 ), 256)

[0085] Key 3D (2i, 2j-1, k) = mod (floor (z (num) × 2 12 ), 256)

[0086] Key 3D (2i, 2j, k)=mod(floor(x(num)y(num)z(num)×2 12 / 3), 256)

[0087] Here, floor() means rounding down, num is the total number of times the nested loop has been run, and i, j, and k represent the number of times the cube has been run in the x, y, and z directions, respectively.

[0088] Step S3: Based on the playing cards and Rubik's Cube model, and according to the generated operation sequence, perform planar rotation and shuffling on the constructed 3D cube to obtain a scrambled cube.

[0089] This embodiment proposes a poker and Rubik's Cube model, which combines a Rubik's Cube rotation model and a poker shuffling model to perform hybrid scrambling on the constructed 3D cube.

[0090] For ease of description, we define the x, y, and z planes in the cube. We place the cube in a three-dimensional coordinate system and define the set of all pixels with a fixed x-coordinate of 'a' as the a-th x-plane, the set of all pixels with a fixed y-coordinate of 'b' as the b-th y-plane, and the set of all pixels with a fixed z-coordinate of 'c' as the c-th z-plane.

[0091] Figure 4 This is a schematic diagram of the Rubik's Cube rotation model, in which... Figure 4 (a), (b), and (c) in the diagram are rotation diagrams of the x, y, and z planes, respectively. By iterating through multiple rotations of the planes to scramble the pixel positions, if the steps of the Rubik's Cube rotation are known, it can be easily restored. However, if the steps of the Rubik's Cube rotation are unknown, it is more difficult to restore. In addition, the Rubik's Cube rotation model is not like a regular Rubik's Cube where each surface has only one color. Instead, it has 256 (grayscale image) or 16,777,216 (color image) different colors arranged in a certain correlation. Restoring it without knowing the scrambling steps is even more difficult.

[0092] However, Rubik's Cube rotations can only shift pixels on the same layer as the surface; they cannot disrupt the cube's layer structure. Therefore, a method is introduced... Figure 5 The poker shuffling model shown can be viewed in step S1, where the plaintext image is stacked after being divided into blocks. This can be considered as a process of connecting N z-planes along the z-axis. Each z-plane can be considered a "poker card," and the entire cube can be considered a "pile."Figure 5 (a) Based on the operation of rearranging the deck after cutting the deck during poker shuffling, a poker shuffling model is proposed, Figure 5 (b) Cutting the deck, Figure 5 (c) Rearranging the deck, through iterative operations, the hierarchical relationship between pixels can be fully disturbed, and the surface and inner layers can be crossed.

[0093] Combining the advantages of both, using Figure 6 the poker and Rubik's cube model shown in the figure to scramble the original cube, Figure 6 (a) Rotate the x plane, Figure 6 (b) Rotate the y plane, according to the value of C(i) in the operation sequence, rotate it 90°, 180° or 270° clockwise; Figure 6 (c) Shuffle the z plane, as shown in Figure 7 According to the value of C(i), rearrange the cut deck, and the above three operations are one iteration, and the specific scrambling rules are as follows:

[0094] ① Choose the iteration number K, K is an integer multiple of N;

[0095] ② Set i = 1;

[0096] ③ Select the A(i)th x plane of CUBE original , rotate the plane by the following operation:

[0097] If C(i) = 1 in the operation sequence, rotate the A(i)th x plane 90° clockwise;

[0098] If C(i) = 2 in the operation sequence, rotate the A(i)th x plane 180° clockwise;

[0099] If C(i) = 3 in the operation sequence, rotate the A(i)th x plane 270° clockwise;

[0100] ④ Select the B(i)th y plane of CUBE original , rotate the plane by the following operation:

[0101] If C(i) = 1 in the operation sequence, rotate the B(i)th y plane 90° clockwise;

[0102] If C(i) = 2 in the operation sequence, rotate the B(i)th y plane 180° clockwise;

[0103] If C(i) = 3 in the operation sequence, rotate the B(i)th y plane 270° clockwise;

[0104] ⑤ Select the B(i)th y plane of CUBE originalAll z-planes of [min, max] are denoted as pile 2, all z-planes of [max+1, N] are denoted as pile 1, and all z-planes of [1, min-1] are denoted as pile 3, where min = min(A(i), B(i)), max = max(A(i), B(i)), and i = 1, 2, 3, …, K, and K is the number of the operation sequence. For example, if min = 2 and max = 5, then pile 2 is [2, 5], pile 1 is [6, 8], and pile 3 is [1, 1]. Figure 7 (a) Shuffle the piles according to the following operations:

[0105] If C(i) = 1 in the operation sequence, pile 2 is taken out and placed on top, as shown in Figure 7 (b).

[0106] If C(i) = 2 in the operation sequence, pile 2 is taken out and placed on the bottom, as shown in Figure 7 (c).

[0107] If C(i) = 3 in the operation sequence, pile 1 and pile 3 are interchanged, as shown in Figure 7 (d).

[0108] (6) i = i + 1.

[0109] (7) Repeat steps 3 to 6 until i > K, and generate the scrambled cube CUBE scrambled .

[0110] Step S4: XOR the scrambled cube with the 3D key bit by bit to obtain the cipher cube, and unfold the cipher cube to generate multiple ciphertext images.

[0111] (1) XOR the scrambled cube CUBE scrambled with the 3D key Key 3D bit by bit to obtain the cipher cube CUBE enc , and the formula is:

[0112]

[0113] (2) Refer to the rules for constructing the cube in step S1 to deconstruct the cipher cube: layer along the z-axis direction to obtain N N×N ciphertext image blocks, and according to the size n×n and the number m of the plaintext image, merge them to generate m n×n ciphertext images.

[0114] The present embodiment also includes a corresponding decryption method, and the decryption process is completely opposite to the encryption process, and the flowchart is shown in Figure 8 , and the specific steps are as follows:

[0115] (1) Input multiple ciphertext images, and according to the method in step S1, block and stack the ciphertext images to generate the cipher cube CUBE enc .

[0116] (2) Based on the saved user key Key and the received plaintext hash value, generate operation sequences A(i), B(i), C(i) and 3D key Key through the method of step S2 3D ;

[0117] (3) Use 3D key key 3D to restore the scrambled cube CUBE scrambled , the formula is:

[0118]

[0119] (4) According to the operation sequences A(i), B(i), C(i), the scrambled cube CUBE scrambled is restored by the following operation, and the 3D cube CUBE dec is obtained:

[0120] ① Get the iteration number K;

[0121] ② Set i = 0;

[0122] ③ Restore the z plane shuffle according to the following operation, where min = min(A(K-i), B(K-i)) and max = max(A(K-i), B(K-i)):

[0123] If C(K-i) = 1 in the operation sequence, all z planes of the scrambled cube CUBE scrambled are divided into three stacks according to the z coordinate value range [max+1, N], [max-min+2, max], [1, max-min+1], respectively denoted as stacks 1, 2 and 3, as shown in Figure 9 (a), insert stack 1 between stacks 2 and 3, and restore the stacks as shown in Figure 9 (d);

[0124] If C(K-i) = 2 in the operation sequence, all z planes of the scrambled cube CUBE scrambled are divided into three stacks according to the z coordinate value range [N-max+1, N], [min, N-max], [1, min-1], respectively denoted as stacks 1, 2 and 3, as shown in Figure 9 (b), insert stack 3 between stacks 1 and 2, and restore the stacks as shown in Figure 9 (d);

[0125] If C(K-i) = 3 in the operation sequence, all z planes of the scrambled cube CUBE scrambled are divided into three stacks according to the z coordinate value range [N-min+2, N], [N-max+1, N-min+1], [1, N-max], respectively denoted as stacks 1, 2 and 3, as shown inFigure 9 (c) as shown, exchange the decks 1, 3, restore the decks as shown in Figure 9 (d) as shown;

[0126] IV. Select the B(i)-th y-plane of the CUBE original , rotate the plane by the following operation:

[0127] If C(K-i) = 1 in the operation sequence, rotate the B(K-i)-th y-plane clockwise by 270°;

[0128] If C(K-i) = 2 in the operation sequence, rotate the B(K-i)-th y-plane clockwise by 180°;

[0129] If C(K-i) = 3 in the operation sequence, rotate the B(K-i)-th y-plane clockwise by 90°;

[0130] V. Select the A(K-i)-th x-plane of the CUBE original , rotate the plane by the following operation:

[0131] If C(K-i) = 1 in the operation sequence, rotate the A(K-i)-th x-plane clockwise by 270°;

[0132] If C(K-i) = 2 in the operation sequence, rotate the A(K-i)-th x-plane clockwise by 180°;

[0133] If C(K-i) = 3 in the operation sequence, rotate the A(K-i)-th x-plane clockwise by 90°;

[0134] VI. i = i + 1;

[0135] VII. Repeat steps III to VI until i = K, end the loop, and generate the scrambled cube CUBE scrambled .

[0136] (5) According to the rule of constructing the cube in step S1, deconstruct the 3D cube CUBE dec , layer along the z-axis direction to obtain N N×N decryption image blocks, and according to the size n×n and the number m of the plaintext image, respectively combine the decryption image blocks to generate m n×n decryption images.

[0137] Taking an 128×128×128 cube constructed by 8 512×512 images as an example, the simulation results of the embodiment are shown in Figure 10 , wherein (a)-(h) are input plaintext images, (i)-(p) are encrypted images, and (q)-(x) are decrypted images.

[0138] It can be seen from the simulation result that the application well balances the scrambling effect and the scrambling efficiency, has high key sensitivity, low correlation and robustness, can effectively resist various attacks on image encryption, has high encryption quality, and has strong recovery ability from loss.

[0139] Embodiment two

[0140] The embodiment discloses a 3D multi-image encryption system based on a poker and Rubik's cube model.

[0141] The 3D multi-image encryption system based on the poker and Rubik's cube model comprises a cubic construction module, a key generation module, a cubic scrambling module and a multi-image encryption module.

[0142] The cubic construction module is configured to acquire a plurality of plaintext images to be encrypted, and construct a 3D cube through blocking and stacking operations.

[0143] The key generation module is configured to generate an operation sequence and a 3D key for the constructed 3D cube by using a SHA function and an interleaved Logistic mapping.

[0144] The cubic scrambling module is configured to perform plane rotation and shuffling on the constructed 3D cube according to the generated operation sequence based on the poker and Rubik's cube model, to obtain a scrambled cube.

[0145] The multi-image encryption module is configured to perform bitwise XOR operation between the scrambled cube and the 3D key, to obtain a cipher cube, and to expand the cipher cube to generate a plurality of ciphertext images.

[0146] Embodiment three

[0147] The embodiment aims to provide a computer-readable storage medium.

[0148] The computer-readable storage medium stores a computer program, and the program is executed by a processor to implement the steps in the 3D multi-image encryption method based on the poker and Rubik's cube model in the embodiment one of the present disclosure.

[0149] Embodiment four

[0150] The embodiment aims to provide an electronic device.

[0151] The electronic device comprises a memory, a processor and a program stored in the memory and executable on the processor, and the processor executes the program to implement the steps in the 3D multi-image encryption method based on the poker and Rubik's cube model in the embodiment one of the present disclosure.

[0152] The above merely provides the preferred embodiments of the present application, and is not used to limit the present application. For those skilled in the art, the present application can have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the principles and technical scope of the present application shall fall into the scope of the present application.

Claims

1. A 3D multi-image encryption method based on poker and Rubik's cube model, characterized in that, The method comprises the following steps: obtaining multiple plaintext images to be encrypted, and constructing a 3D cube through block division and stacking operations; generating an operation sequence and a 3D key for the constructed 3D cube by using an SHA function and an interleaved Logistic mapping; based on a card and Rubik's cube model, performing plane rotation and shuffling on the constructed 3D cube according to the generated operation sequence to obtain a scrambled cube; the card and Rubik's cube model specifically comprises the following steps: (1) placing the 3D cube in a three-dimensional coordinate system, and defining x plane, y plane and z plane sets; (2) performing plane rotation on the x plane and the y plane, respectively; (3) performing segmentation on the z plane to obtain multiple card stacks, and rearranging the segmented card stacks; (4) iteratively performing steps (2)-(3) until the iteration number is satisfied, and finally obtaining the scrambled cube; the x plane: all pixel points with a fixed x coordinate a belong to the a-th x plane; the y plane: all pixel points with a fixed y coordinate b belong to the b-th y plane; the z plane: all pixel points with a fixed z coordinate c belong to the c-th z plane; performing exclusive OR operation between the scrambled cube and the 3D key bit by bit to obtain a cipher cube, and expanding the cipher cube to generate multiple ciphertext images.

2. The 3D multi-image encryption method based on poker and Rubik's cube model according to claim 1, wherein, The method for generating an operation sequence and a 3D key for the constructed 3D cube comprises the following steps: calculating SHA256 for the 3D cube, performing exclusive OR operation between the obtained hash value and a preselected 256-bit binary user key to obtain a 256-bit binary number; generating a 32-length decimal array by using the obtained binary number, and calculating parameters and initial values of the interleaved Logistic mapping; performing the interleaved Logistic mapping on the parameters and the initial values to obtain a chaotic sequence; generating the operation sequence and the 3D key based on the chaotic sequence.

3. The 3D multi-image encryption method based on poker and Rubik's cube model according to claim 1, wherein, The card and Rubik's cube model comprises a Rubik's cube rotation model and a card shuffling model.

4. The 3D multi-image encryption method based on poker and Rubik's cube model according to claim 3, characterized in that, The Rubik's cube rotation model disturbs the pixel positions through multiple iterative rotation of the plane.

5. The 3D multi-image encryption method based on poker and Rubik's cube model according to claim 3, characterized in that, The card shuffling model disturbs the hierarchical relationship between the pixels through iterative operation to realize the crossing between the surface and the inner layer.

6. A 3D multi-image encryption system based on poker and Rubik's cube model, characterized in that, The method comprises a cube construction module, a key generation module, a cube scrambling module and a multi-image encryption module. The cube construction module is configured to obtain multiple plaintext images to be encrypted, and construct a 3D cube through block division and stacking operations. The key generation module is configured to generate an operation sequence and a 3D key for the constructed 3D cube by using an SHA function and an interleaved Logistic mapping. The cube scrambling module is configured to perform plane rotation and shuffling on the constructed 3D cube according to the generated operation sequence based on a card and Rubik's cube model to obtain a scrambled cube; the card and Rubik's cube model specifically comprises the following steps: (1) placing the 3D cube in a three-dimensional coordinate system, and defining x plane, y plane and z plane sets; (2) performing plane rotation on the x plane and the y plane, respectively; (3) performing segmentation on the z plane to obtain multiple card stacks, and rearranging the segmented card stacks; (4) iteratively performing steps (2)-(3) until the iteration number is satisfied, and finally obtaining the scrambled cube. The x plane: the set of all pixel points with a fixed value a of x coordinate is the a th x plane; The y plane: the set of all pixel points with a fixed value b of y coordinate is the b th y plane; The z plane: the set of all pixel points with a fixed value c of z coordinate is the c th z plane; The multi-image encryption module is configured to: perform bitwise XOR operation between the scrambled cube and the 3D key to obtain a cipher cube, and expand the cipher cube to generate a plurality of ciphertext images.

7. An electronic device, comprising: a memory for non-transiently storing computer readable instructions; and a processor for executing the computer readable instructions, wherein the computer readable instructions, when executed by the processor, perform the method of any one of claims 1-5. non-transiently storing computer readable instructions, wherein the non-transient computer readable instructions, when executed by a computer, perform the instructions of the method of any one of claims 1-5.

8. A storage medium characterized by, ​

Images