Three-dimensional model fusion encryption method, medium and device

Abstract

The present invention provides a three-dimensional model fusion encryption method, system, medium and device, including the following steps: Data preprocessing step: Preprocess the preset information extracted from the three-dimensional model to make it meet the input requirements of the encryption algorithm; AES encryption step: Encrypt the data obtained in the data preprocessing step through the AES algorithm; RSA key encryption step: Encrypt the key of the data obtained in the data preprocessing step through the RSA algorithm; Encryption transmission step: After completing the encryption of the three-dimensional model data, when transmitting the three-dimensional model data, use the RSA algorithm to encrypt and transmit the AES algorithm key. The present invention solves the problems of too long encryption time and too high complexity caused by the large amount of three-dimensional model data, and ensures the anti-brute force cracking ability of the algorithm.

Description

Technical Field

[0001] The present invention relates to the technical field of data encryption, and specifically, to a three-dimensional model fusion encryption method, system, medium and device, in particular to a three-dimensional model fusion encryption method based on improved AES and RSA. Background Art

[0002] With the continuous progress and development of technology, the application scenarios of three-dimensional models are becoming more and more extensive. In the fields of game development, virtual reality, architectural design, industrial manufacturing, medical imaging, etc., three-dimensional models play a crucial role. Therefore, encrypting three-dimensional files to improve their security during transmission and use becomes increasingly important.

[0003] However, compared with other files, three-dimensional model files have unique characteristics, mainly including: a. The data volume of three-dimensional model files is large, resulting in a significant increase in the computational amount and time complexity of encryption and decryption. Although traditional encryption algorithms can be extended to larger data, it will lead to too long data encryption and decryption time and is not applicable to the three-dimensional model scenario; b. The data of three-dimensional model files usually has a dependence on spatial positions, especially the obvious association of adjacent triangular style structures, while traditional encryption algorithms are difficult to protect this dependence. Moreover, three-dimensional models usually consist of multiple parts, some parts need to be encrypted, and some parts need to be public. Traditional encryption algorithms are difficult to identify and process such details. At the same time, for commonly used symmetric AES and DES algorithms, directly transmitting the key may lead to the leakage of the key, and the asymmetric RSA algorithm is not suitable for encrypting a large amount of data.

[0004] Based on the above technical background, the present invention provides a fusion encryption method based on AES and RSA. By only encrypting important information in the three-dimensional model, the amount of encrypted data is reduced; using the surface-based triangular style structure for encryption and adopting a dynamic block division method to hide the dependence of spatial positions to ensure the security and integrity of encryption; at the same time, by reducing the number of encryption rounds and improving the S-box and round key generation algorithm of the encryption algorithm, the encryption efficiency and security are further improved. Summary of the Invention

[0005] Aiming at the defects in the prior art, the purpose of the present invention is to provide a three-dimensional model fusion encryption method, system, medium and device.

[0006] According to a three-dimensional model fusion encryption method provided by the present invention, it includes the following steps:

[0007] Data preprocessing step: preprocess the preset information extracted from the three-dimensional model to make it adapt to the input requirements of the encryption algorithm;

[0008] AES encryption step: Encrypt the data obtained in the data preprocessing step through the AES algorithm;

[0009] RSA key encryption step: Encrypt the key of the data obtained in the data preprocessing step through the RSA algorithm;

[0010] Encryption transmission step: After completing the encryption of the 3D model data, when transmitting the 3D model data, use the RSA algorithm to encrypt and transmit the AES algorithm key.

[0011] Preferably, the data preprocessing step specifically includes the following steps:

[0012] Data extraction step: Extract the preset information to be encrypted from the 3D model;

[0013] Data conversion step: Convert the data type of the extracted preset information to make it adapt to the data format used by the encryption algorithm;

[0014] Data length control step: Adjust the length of the extracted preset information to make it adapt to the length requirements of the encryption algorithm;

[0015] Data verification step: Verify the legality and integrity of the extracted preset information.

[0016] Preferably, the preset information to be encrypted is color data and coordinate position data;

[0017] Convert the color data to the RGB format so that the range and precision of the color values meet the requirements of the encryption algorithm;

[0018] Determine the coordinate system or local coordinate system of the 3D model, and standardize the coordinate position data to make it adapt to the requirements of the encryption algorithm for the input data;

[0019] Dynamic block division based on Euclidean distance: Re-divide the 3D model data based on Euclidean distance, shuffle the order of the triangular blocks of the 3D model data, and hide the dependency relationship of the spatial position of the 3D model file.

[0020] Preferably, the dynamic block division based on Euclidean distance specifically includes the following steps:

[0021] Central point coordinate acquisition step: For each triangular block in the 3D model data, calculate the coordinates of all its vertices and calculate their average value to obtain the central point coordinates of the triangular block;

[0022] Target point coordinate acquisition step: Define a certain point in 3D space as the target point, and its coordinates are defined as the coordinates of the target point;

[0023] Distance calculation steps: For each triangular block, use the Euclidean distance formula to calculate the Euclidean distance between its center point and the target point. The specific formula is as follows:

[0024]

[0025] Among them, (x1, y1, z1) are the coordinates of the center point of the triangular block, and (x2, y2, z2) are the coordinates of the target point;

[0026] Sorting steps: Arrange in ascending order according to the calculated Euclidean distance values.

[0027] Preferably, the data length control step is specifically as follows:

[0028] If the length of the preset information is greater than the maximum input length required by the encryption algorithm, slice or segment the data so that the length of each slice or segment is within the range required by the algorithm;

[0029] If the length of the preset information is less than the minimum input length required by the encryption algorithm, expand it to the length required by the algorithm by means of padding.

[0030] Preferably, the AES encryption step specifically includes the following steps:

[0031] Encryption round number confirmation step: Select the encryption round number of the AES algorithm according to the results of security evaluation and application requirements;

[0032] Dynamic S-box generation step: Select an initial S-box alternative set. The alternative set contains multiple S-boxes. Each S-box in the alternative set is a 16×16 byte substitution table with different element arrangements and mapping rules; Use the key as the input to generate a selection matrix. Each element in the selection matrix represents which S-box to choose as the S-box in the current encryption round in each round; In each round, dynamically select an S-box from the S-box alternative set using the selection matrix. According to the elements in the selection matrix, determine the S-box used in this round and apply it to the byte substitution operation;

[0033] Round key generation step: Adopt a calculation method based on an irreversible algorithm to generate a round key matrix through the initial key and expand the storage distance between the generated round key data and the original data.

[0034] Preferably, the RSA key encryption step is specifically as follows:

[0035] Expand 1 prime number for RSA key calculation and generate keys using 3 prime numbers. The specific calculation process includes:

[0036] Step 1: Randomly generate 3 different large prime numbers a, b, c;

[0037] Step 2: Calculate the modulus using these 3 different prime numbers: n = a * b * c;

[0038] Step 3: Calculate the Euler's totient function value using these 3 prime numbers:

[0039] Step 4: According to the Euler's totient function, select a value e as the public key, satisfying and e is relatively prime to ;

[0040] Step 5: After determining the public key e, calculate the private key through the public key e and the Euler number:

[0041] Step 6: Obtain the public key pair (e, n) and the private key pair (d, n).

[0042] The present invention also provides a three-dimensional model fusion encryption system, including the following modules:

[0043] Data preprocessing module: Preprocess the preset information extracted from the three-dimensional model to make it meet the input requirements of the encryption algorithm;

[0044] AES encryption module: Encrypt the data obtained in the data preprocessing step through the AES algorithm;

[0045] RSA key encryption module: Encrypt the key of the data obtained in the data preprocessing step through the RSA algorithm;

[0046] Encryption transmission module: After encrypting the three-dimensional model data, when transmitting the model data, use the RSA algorithm to encrypt and transmit the AES algorithm key.

[0047] The present invention also provides a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, the steps of the above three-dimensional model fusion encryption method are implemented.

[0048] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the computer program is executed by the processor, the steps of the above three-dimensional model fusion encryption method are implemented.

[0049] Compared with the prior art, the present invention has the following beneficial effects:

[0050] 1. The present invention solves the problems of too long encryption time and too high complexity caused by large three-dimensional model data, and ensures the anti-brute-force cracking ability of the algorithm.

[0051] 2. The encryption method of the present invention sorts the triangular blocks through the Euclidean distance, disrupting the original order of the triangular blocks and solving the problem of obvious spatial position dependence relationship in the 3D model file.

[0052] 3. The encryption method of the present invention improves the AES key through the RSA encryption of three prime numbers, increasing the difficulty of the key being cracked during transmission and ensuring the security of data transmission.

[0053] 4. The encryption method of the present invention reduces the amount of encrypted data, reduces the time complexity of the encryption algorithm, increases the randomness of data processing by generating a dynamic S-box, enhances the dispersion of the encrypted data, and improves the round key generation algorithm to enhance the security of the generated round key. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] By reading the following detailed description of the non-limiting embodiments with reference to the accompanying drawings, other features, objects, and advantages of the present invention will become more apparent:

[0055] Figure 1 is a schematic flow diagram of dynamic block division based on the Euclidean distance;

[0056] Figure 2 is a schematic flow diagram of generating a dynamic S-box;

[0057] Figure 3 is a schematic diagram of the storage of the initial key elements;

[0058] Figure 4 is a schematic diagram of the round key generation step;

[0059] Figure 5 is a schematic flow diagram of the encryption process of the improved AES algorithm and RSA algorithm. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0060] The present invention will be described in detail below with reference to specific embodiments. The following embodiments will help those skilled in the art to further understand the present invention, but do not limit the present invention in any form. It should be noted that those of ordinary skill in the art can make several changes and improvements without departing from the concept of the present invention. These all belong to the protection scope of the present invention.

[0061] Example 1:

[0062] As Figures 1 to 5 shown, this embodiment provides a 3D model fusion encryption method, including the following steps:

[0063] Data preprocessing step: Preprocess the preset information extracted from the 3D model to make it meet the input requirements of the encryption algorithm; the data preprocessing step specifically includes the following steps:

[0064] Data extraction step: Extract the preset information to be encrypted from the 3D model;

[0065] Data conversion step: Convert the data type of the extracted preset information to adapt to the data format used by the encryption algorithm;

[0066] Data length control step: Adjust the length of the extracted preset information to meet the length requirements of the encryption algorithm;

[0067] Data verification step: Verify the legality and integrity of the extracted preset information;

[0068] The preset information to be encrypted is color data and coordinate position data;

[0069] Convert the color data to the RGB format so that the range and precision of the color values meet the requirements of the encryption algorithm;

[0070] Determine the coordinate system or local coordinate system of the 3D model, and standardize the coordinate position data to adapt to the requirements of the encryption algorithm for input data;

[0071] Dynamically divide blocks based on the Euclidean distance, re-divide the 3D model data into blocks according to the Euclidean distance, shuffle the order of the triangular blocks of the 3D model data, and hide the dependency relationship of the spatial position of the 3D model file;

[0072] Dynamically dividing blocks based on the Euclidean distance specifically includes the following steps:

[0073] Central point coordinate acquisition step: For each triangular block in the 3D model data, calculate the coordinates of all its vertices and calculate their average value to obtain the central point coordinates of the triangular block;

[0074] Target point coordinate acquisition step: Define a point in 3D space as the target point, and its coordinates are defined as the coordinates of the target point;

[0075] Distance calculation step: For each triangular block, use the Euclidean distance formula to calculate the Euclidean distance between its central point and the target point. The formula is as follows:

[0076]

[0077] where (x1, y1, z1) are the central point coordinates of the triangular block, and (x2, y2, z2) are the coordinates of the target point;

[0078] Sorting step: Sort in ascending order according to the calculated Euclidean distance values;

[0079] The data length control step is specifically:

[0080] If the length of the preset information is greater than the maximum input length required by the encryption algorithm, the data is sliced or segmented so that the length of each slice or segment is within the range required by the algorithm;

[0081] If the length of the preset information is less than the minimum input length required by the encryption algorithm, it is extended to the length required by the algorithm by padding.

[0082] AES encryption steps: Encrypt the data obtained in the data preprocessing step through the AES algorithm; The AES encryption steps specifically include the following steps:

[0083] Encryption round confirmation step: Select the number of encryption rounds of the AES algorithm according to the results of the security assessment and application requirements;

[0084] Dynamic S-box generation step: Select an initial S-box alternative set, which contains multiple S-boxes. Each S-box in the alternative set is a 16×16 byte substitution table with different element arrangements and mapping rules; Use the key as the input to generate a selection matrix. Each element in the selection matrix indicates which S-box to select as the S-box in the current encryption round in each round; In each round, use the selection matrix to dynamically select an S-box from the S-box alternative set, and determine the S-box used in this round according to the elements in the selection matrix, and apply it to the byte substitution operation;

[0085] Round key generation step: Adopt a calculation method based on an irreversible algorithm to generate a round key matrix through the initial key, and increase the storage distance between the generated round key data and the original data.

[0086] RSA key encryption steps: Encrypt the key of the data obtained in the data preprocessing step through the RSA algorithm; The specific steps of RSA key encryption are:

[0087] Expand 1 prime number for RSA key calculation, and use 3 prime numbers to generate the key. The specific calculation process includes:

[0088] Step 1: Randomly generate 3 different large prime numbers a, b, c;

[0089] Step 2: Use these 3 different prime numbers to calculate the modulus: n = a * b * c;

[0090] Step 3: Use these 3 prime numbers to calculate the Euler's totient function value:

[0091] Step 4: According to the Euler's totient function, select a value e as the public key, satisfying and e is relatively prime to ;

[0092] Step 5: After determining the public key e, calculate the private key through the public key e and the Euler number:

[0093] Step 6: Obtain the public key pair (e, n) and the private key pair (d, n).

[0094] Encryption transmission step: After encrypting the 3D model data, when transmitting the 3D model data, use the RSA algorithm to encrypt and transmit the AES algorithm key.

[0095] This embodiment also provides a computer-readable storage medium storing a computer program. When the computer program is executed by a processor, the steps of the above 3D model fusion encryption method are implemented.

[0096] This embodiment also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the computer program is executed by the processor, the steps of the above 3D model fusion encryption method are implemented.

[0097] The present invention also provides a 3D model fusion encryption system. The 3D model fusion encryption system can be implemented by executing the process steps of the 3D model fusion encryption method. That is, those skilled in the art can understand the 3D model fusion encryption method as a preferred embodiment of the 3D model fusion encryption system.

[0098] Example 2:

[0099] This embodiment provides a 3D model fusion encryption system, including the following modules:

[0100] Data preprocessing module: Preprocess the preset information extracted from the 3D model to make it meet the input requirements of the encryption algorithm;

[0101] AES encryption module: Encrypt the data obtained in the data preprocessing step through the AES algorithm;

[0102] RSA key encryption module: Encrypt the key of the data obtained in the data preprocessing step through the RSA algorithm;

[0103] Encryption transmission module: After encrypting the 3D model data, when transmitting the model data, use the RSA algorithm to encrypt and transmit the AES algorithm key.

[0104] Example 3:

[0105] Those skilled in the art can understand this embodiment as a more specific description of Embodiment 1 and Embodiment 2.

[0106] The purpose of this embodiment is to provide an encryption method for 3D model files. According to this method, 3D model files can be encrypted while ensuring encryption efficiency and security.

[0107] To achieve the above purpose, this embodiment provides a 3D model fusion encryption method based on improved AES and RSA, including the following steps:

[0108] (1) Data preprocessing. Extract important information to be encrypted from the 3D model, such as color, coordinate position, etc. Preprocess and transform the extracted information to ensure it meets the requirements of the encryption algorithm.

[0109] Convert the color information to the RGB format or other data representation formats suitable for the encryption algorithm, and ensure that the range and precision of the color values meet the algorithm requirements.

[0110] Determine the coordinate system or local coordinate system of the model, and standardize the coordinate position to meet the requirements of the encryption algorithm for the input data. For example, convert the coordinate position to a relative value or an offset relative to a specific reference point.

[0111] Based on the Euclidean distance, dynamically divide the blocks. Re-divide the data based on the Euclidean distance, shuffle the order of the triangular blocks of the 3D model data, and hide the dependency relationship of the spatial position of the 3D model file.

[0112] Among them, the dynamic block division based on the Euclidean distance includes:

[0113] a. Calculate the center point of the triangular block: For each triangular block, calculate the coordinates of all vertices therein and calculate their average value to obtain the center point coordinates of the triangular block;

[0114] b. Obtain the coordinates of the target point: Define a certain point in the 3D space as the target point, and its coordinates are the coordinates of the target point;

[0115] c. Calculate the distance: For each triangular block, calculate the Euclidean distance between its center point and the target point. Use the Euclidean distance formula to calculate the distance, where (x1, y1, z1) are the center point coordinates of the triangular block, and (x2, y2, z2) are the coordinates of the target point;

[0116] d. Sorting: Arrange in ascending order according to the calculated distance values.

[0117] (2) Data conversion. Ensure that the data type of the important information is consistent with the data type required by the encryption algorithm. For example, convert floating-point numbers to integers, or convert the data type from floating-point numbers to byte streams. Encode the important information to ensure it meets the data format or input requirements used by the encryption algorithm. For example, perform character encoding UTF-8 on text information.

[0118] (3) Data length control. If the length of important information exceeds the maximum input length required by the encryption algorithm, the data can be sliced or segmented to ensure that the length of each slice is within the range required by the algorithm. For important information with insufficient length, it can be padded to the length required by the algorithm using the PKCS7 padding method.

[0119] (4) Data verification. Ensure that the extracted important information meets specific legal requirements. For example, perform range verification on color information to ensure that the color value is between 0 and 255. Before encryption, perform integrity verification on the extracted important information to ensure that the data has not been tampered with or damaged.

[0120] (5) Perform AES encryption on the verified data.

[0121] Mainly includes:

[0122] Step 1: Determine the number of encryption rounds. According to the results of security assessment and application requirements, select an appropriate number of encryption rounds. Usually, the standard number of encryption rounds for the AES algorithm is 10 rounds, 12 rounds, or 14 rounds, depending on the key length. Reduce the number of encryption rounds to 8 rounds, 10 rounds, or 12 rounds according to the actual situation to improve encryption efficiency;

[0123] Step 2: Generate a dynamic S-box. Propose an innovative scheme for dynamically generating the S-box to increase the security of the AES algorithm;

[0124] a. Select an initial S-box alternative set, which contains multiple S-boxes. Each S-box in the alternative set is a 16×16 byte substitution table with different element arrangements and mapping rules;

[0125] b. Generate a selection matrix. Use the key as input to generate a selection matrix. The dimension of the selection matrix is related to the number of rounds of the AES algorithm and can be adjusted as needed. Each element in the selection matrix represents which S-box to select as the S-box in the current encryption round in each round;

[0126] c. Dynamically select the S-box. In each round, use the selection matrix to dynamically select the S-box from the S-box alternative set. Determine the S-box used in this round according to the elements in the selection matrix and apply it to the byte substitution operation. The elements in the selection matrix can be selected according to specific transformation rules of the number of rounds and the key to increase dynamicity and randomness.

[0127] Step 3: Generate round keys. Adopt a calculation method based on an irreversible algorithm to generate a round key matrix from the initial key and increase the storage distance between the generated round key data and the original data to improve data security.

[0128] Taking a 16 - byte initial key as an example, its generated round keys are word vectors of dimension 44. The initial key is stored in the computer memory in the form of word vectors of dimension 4, and the storage method of the four elements in the vector in the round - key vector is as shown in Figure 3 shown. The other elements in the round key are generated based on these four elements, and the specific element - generation rules are as shown in Figure 4 shown. Figure 4 In Figure 4 , the function f performs XOR, confusion and other operations on three parameters to initially generate data, so as to ensure the irrelevance between adjacent elements in the round key. After the operation, the generated data is further processed by a non - reversible hashing operation to obtain the final key data, further ensuring the security of the key.

[0129] (6) Perform RSA key encryption. To improve the operation efficiency, one prime number is added for RSA key calculation, that is, three prime numbers are used to generate the key. The specific calculation process includes:

[0130] Step 1: Randomly generate three different large prime numbers a, b, and c;

[0131] Step 2: Use these three different prime numbers to calculate the modulus: n = a * b * c;

[0132] Step 3: Use these three prime numbers to calculate the Euler's totient function value;

[0133] Step 4: According to the Euler's totient function, select a value e as the public key. The public key should be as large as possible and satisfy and e is relatively prime to ;

[0134] Step 5: After determining the public key, calculate the private key through the public key and the Euler number:

[0135] Step 6: Obtain the public - key pair (e, n) and the private - key pair (d, n).

[0136] (7) Complete the encryption of the three - dimensional model data. When transmitting the model data, the improved RSA algorithm is used to encrypt and transmit the AES key, improving the security of the entire encryption process. The complete encryption process is as shown in Figure 5 shown.

[0137] The present invention solves the problems of too long encryption time and too high complexity caused by the large three - dimensional model data, and ensures the anti - brute - force - cracking ability of the algorithm.

[0138] Those skilled in the art know that in addition to implementing the system and its various devices, modules, and units provided by the present invention in the form of pure computer-readable program code, the method steps can be logically programmed to enable the system and its various devices, modules, and units provided by the present invention to be implemented in the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers, etc., to achieve the same functions. Therefore, the system and its various devices, modules, and units provided by the present invention can be considered as a kind of hardware component, and the devices, modules, and units included therein for implementing various functions can also be regarded as the structures within the hardware component; the devices, modules, and units for implementing various functions can also be regarded as either software modules for implementing the method or structures within the hardware component.

[0139] The specific embodiments of the present invention have been described above. It should be understood that the present invention is not limited to the above specific embodiments, and those skilled in the art can make various changes or modifications within the scope of the claims, which do not affect the essence of the present invention. Without conflict, the embodiments of the present application and the features in the embodiments can be combined with each other arbitrarily.

Claims

1. A three-dimensional model fusion encryption method, characterized in that It includes the following steps: Data preprocessing step: Preprocess the preset information extracted from the 3D model to make it meet the input requirements of the encryption algorithm; AES encryption step: Encrypt the data obtained in the data preprocessing step through the AES algorithm; RSA key encryption step: Encrypt the key of the data obtained in the data preprocessing step through the RSA algorithm; Encrypted transmission step: After completing the encryption of the 3D model data, when transmitting the 3D model data, use the RSA algorithm to encrypt and transmit the AES algorithm key; The data preprocessing step specifically includes the following steps: Data extraction step: Extract the preset information to be encrypted from the 3D model; Data conversion step: Convert the data type of the extracted preset information to make it meet the data format used by the encryption algorithm; Data length control step: Adjust the length of the extracted preset information to make it meet the length requirements of the encryption algorithm; Data verification step: Verify the legality and integrity of the extracted preset information; The preset information to be encrypted is color data and coordinate position data; Convert the color data to the RGB format to make the range and precision of the color values meet the requirements of the encryption algorithm; Determine the coordinate system or local coordinate system of the 3D model, and standardize the coordinate position data to make it meet the requirements of the encryption algorithm for the input data; Dynamically divide blocks based on the Euclidean distance, re-divide the 3D model data with the Euclidean distance, shuffle the order of the triangular blocks of the 3D model data, and hide the dependency relationship of the spatial position of the 3D model file; Dynamically dividing blocks based on the Euclidean distance specifically includes the following steps: Central point coordinate acquisition step: For each triangular block in the 3D model data, calculate the coordinates of all its vertices and calculate their average value to obtain the central point coordinate of the triangular block; Target point coordinate acquisition step: Define a certain point in the 3D space as the target point, and its coordinates are defined as the coordinates of the target point; Distance calculation step: For each triangular block, use the Euclidean distance formula to calculate the Euclidean distance between its central point and the target point. The formula is as follows: where, (x1, y1, z1) is the central point coordinate of the triangular block, and (x2, y2, z2) is the coordinate of the target point; Sorting step: Sort in ascending order according to the calculated Euclidean distance values.

2. The three-dimensional model fusion encryption method according to claim 1, wherein The data length control step is specifically: If the length of the preset information is greater than the maximum input length required by the encryption algorithm, slice or segment the data so that the length of each slice or segment is within the range required by the algorithm; If the length of the preset information is less than the minimum input length required by the encryption algorithm, expand it to the length required by the algorithm by means of padding.

3. The three-dimensional model fusion encryption method according to claim 1, characterized in that The AES encryption step specifically includes the following steps: Encryption round confirmation step: Select the number of encryption rounds of the AES algorithm according to the results of the security assessment and application requirements; Steps for generating a dynamic S-box: Select an initial S-box candidate set, which contains multiple S-boxes. Each S-box in the candidate set is a 16×16 byte substitution table with different element arrangements and mapping rules; Use the key as input to generate a selection matrix, where each element in the selection matrix indicates which S-box to choose as the S-box in the current encryption round in each round; In each round, dynamically select an S-box from the S-box candidate set using the selection matrix. Determine the S-box used in this round according to the elements in the selection matrix and apply it to the byte substitution operation; Steps for generating round keys: Adopt a calculation method based on an irreversible algorithm to generate a round key matrix from the initial key and increase the storage distance between the generated round key data and the original data.

4. The three-dimensional model fusion encryption method according to claim 1, wherein The specific RSA key encryption steps are as follows: Expand one prime number for RSA key calculation and generate keys using three prime numbers. The specific calculation process includes: Step 1: Randomly generate three different large prime numbers a, b, and c; Step 2: Calculate the modulus using these three different prime numbers: n = a * b * c; Step 3: Calculate the Euler's totient function value using these 3 prime numbers: Step 4: According to the Euler's totient function, select a value e as the public key, satisfying and e is relatively prime to ; Step 5: After determining the public key e, calculate the private key using the public key e and the Euler number: Step 6: Obtain the public key pair (e, n) and the private key pair (d, n).

5. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the three-dimensional model fusion encryption method described in any one of claims 1 to 4.

6. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein, When the computer program is executed by a processor, it implements the steps of the three-dimensional model fusion encryption method described in any one of claims 1 to 4.

Images