Data processing method, system and device, equipment, storage medium and product

Abstract

The embodiment of the invention provides a data processing method, system, device and equipment, a storage medium and a product. The method comprises the following steps: acquiring a preset folding key; wherein the folding key comprises at least one group of folding rules, and the folding rules define a folding unit length, a folding starting position, a folding ending position, folding times, a folding reference and a folding direction; and taking the obtained original data as an initial value, and applying each group of folding rules according to a preset sequence to obtain encrypted data. Therefore, according to the embodiment of the invention, the data is folded by using the self-defined folding key to generate the encrypted data, so that complex key management of both communication parties is not needed, the potential safety hazard is reduced, the complexity of data operation is also reduced, and the data processing efficiency is further improved.

Description

Technical Field

[0001] This invention relates to the field of data encryption processing technology, and in particular to a data processing method, system, apparatus, device, storage medium, and product. Background Technology

[0002] In the field of information security, binary encryption technology plays a crucial role and is widely used for data protection and communication security. Currently, existing binary encryption schemes can be mainly divided into two categories: symmetric encryption and asymmetric encryption.

[0003] Symmetric encryption algorithms, such as the Advanced Encryption Standard (AES) and the Data Encryption Standard (DES), rely on the same key for both encryption and decryption. This method suffers from complex key management, which can easily lead to chaos and security vulnerabilities in large-scale systems. Asymmetric encryption algorithms, such as the Rivest-Shamir-Adleman Encryption Algorithm (RSA) and Elliptic Curve Cryptography (ECC), use a public and private key pair for encryption and decryption. Since the public key can be publicly disclosed while the private key must be kept strictly confidential, this mechanism simplifies key distribution and management. However, asymmetric encryption also has drawbacks; its higher computational complexity results in relatively slower processing speeds.

[0004] Therefore, there is a need to provide a data encryption method that can balance security and processing efficiency. Summary of the Invention

[0005] This invention provides a data processing method, system, apparatus, device, storage medium, and product that can generate encrypted data by folding data using a custom folding key. This not only eliminates the need for complex key management between communicating parties, reducing security risks, but also reduces the complexity of data computation, thereby improving data processing efficiency.

[0006] In a first aspect, embodiments of the present invention provide a data processing method, including:

[0007] Obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, number of folds, folding reference and folding direction;

[0008] Using the obtained raw data as the initial value, the folding rules of each group are applied in a preset order to obtain encrypted data.

[0009] Secondly, embodiments of the present invention also provide a data processing method, including:

[0010] Obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, number of folds, folding reference and folding direction;

[0011] Receive encrypted data;

[0012] Using the encrypted data as the initial value, the original data is obtained by applying the folding rules of each group in the reverse order of the preset order in the folding key.

[0013] Thirdly, embodiments of the present invention also provide a data processing method, including:

[0014] The data sender obtains a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, folding number, folding reference and folding direction;

[0015] The data sender uses the original data obtained as the initial value, applies the folding rules of each group in a preset order to obtain encrypted data, and sends the encrypted data to the data receiver.

[0016] The data receiver obtains the fold key and the encrypted data;

[0017] The data receiver uses the encrypted data as the initial value and applies each set of folding rules in the reverse order of the preset order in the folding key to obtain the original data.

[0018] Fourthly, embodiments of the present invention also provide a data processing system, including a data sender and a data receiver, wherein the data sender is configured to perform the data processing method as described in the first aspect, and the data receiver is configured to perform the data processing method as described in the second aspect.

[0019] Fifthly, embodiments of the present invention also provide a data processing apparatus, comprising:

[0020] A key acquisition module is used to acquire a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, number of folds, folding reference and folding direction;

[0021] The data encryption module is used to obtain encrypted data by applying the folding rules of each group in a preset order, using the obtained raw data as the initial value.

[0022] Sixthly, embodiments of the present invention also provide a data processing apparatus, comprising:

[0023] A key determination module is used to obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, folding number, folding reference and folding direction;

[0024] The data receiving module is used to receive encrypted data;

[0025] The data decryption module is used to apply the folding rules of each group in the reverse order of the preset order in the folding key, with the encrypted data as the initial value, to obtain the original data.

[0026] In a seventh aspect, embodiments of the present invention also provide a data processing apparatus, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor executes the computer program to implement the data processing method as described in any of the above embodiments.

[0027] Eighthly, embodiments of the present invention also provide a computer-readable storage medium, the computer-readable storage medium including a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to perform the data processing method as described in any of the above embodiments.

[0028] In a ninth aspect, embodiments of the present invention also provide a computer program product, including a computer program / instructions, which, when executed by a processor, implement the data processing method as described in any of the above embodiments.

[0029] Compared with existing technologies, the data processing method, system, apparatus, device, storage medium, and product provided in this invention obtain a preset folding key. The folding key includes at least one set of folding rules, which define the folding unit length, folding start position, folding end position, number of folds, folding reference, and folding direction. Using the obtained raw data as initial values, the folding rules are applied in a preset order to obtain encrypted data. Therefore, this invention utilizes a custom folding key to fold data and generate encrypted data, eliminating the need for complex key management between communicating parties, reducing security risks, and lowering the complexity of data computation, thereby improving data processing efficiency. Attached Figure Description

[0030] Figure 1 This is a flowchart illustrating a data processing method according to an embodiment of the present invention;

[0031] Figure 2 This is a schematic diagram of a folded key structure provided in an embodiment of the present invention;

[0032] Figure 3 This is a schematic diagram of the structure of a folded key for a 100-byte binary string according to an embodiment of the present invention;

[0033] Figure 4 This is a schematic diagram of the structure of an encryption matrix provided in an embodiment of the present invention;

[0034] Figure 5 This is a schematic diagram illustrating the calculation of matrix ciphertext for a folded key according to an embodiment of the present invention;

[0035] Figure 6 This is a schematic diagram of a left-outward folding method provided in an embodiment of the present invention;

[0036] Figure 7 This is a schematic diagram of a left inward folding method provided in an embodiment of the present invention;

[0037] Figure 8 This is a schematic diagram of a right-outward folding method provided in an embodiment of the present invention;

[0038] Figure 9 This is a schematic diagram of a right inward folding method provided in an embodiment of the present invention;

[0039] Figure 10 This is a flowchart illustrating a data processing method according to an embodiment of the present invention;

[0040] Figure 11 This is a schematic diagram illustrating the calculation of the inverse matrix of an encryption matrix according to an embodiment of the present invention;

[0041] Figure 12 This is a schematic diagram of a fold key calculation provided in an embodiment of the present invention;

[0042] Figure 13 This is a schematic diagram of the structure of a data processing device provided in an embodiment of the present invention;

[0043] Figure 14 This is a schematic diagram of the structure of a data processing device provided in an embodiment of the present invention;

[0044] Figure 15 This is a schematic diagram of the structure of a data processing device provided in an embodiment of the present invention. Detailed Implementation

[0045] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0046] Existing binary encryption schemes mainly fall into two categories: symmetric encryption and asymmetric encryption. Symmetric encryption algorithms, typically represented by the Advanced Encryption Standard (AES) and the Data Encryption Standard (DES), use the same key for both encryption and decryption. While these algorithms offer high speed and efficiency, key distribution and management remain a significant challenge in practical applications. Each communicating pair needs to share a key, which can easily lead to key management chaos and security vulnerabilities in large-scale systems. Asymmetric encryption algorithms, including the RSA (Rivest-Shamir-Adleman Encryption Algorithm) and Elliptic Curve Cryptography (ECC), use a public and private key pair for encryption and decryption. Since the public key can be published while the private key must be kept secret, this mechanism simplifies key distribution and management. However, asymmetric encryption is computationally complex, with large computational demands and slow processing speeds, making it unsuitable for encrypting large amounts of data. This results in poor performance in high-performance and high-frequency communications. Hybrid encryption schemes combine the advantages of symmetric and asymmetric encryption, but their implementation and maintenance are complex, involving multiple encryption methods and key management strategies. This increases the complexity of the system and the potential for vulnerabilities.

[0047] Based on this, one embodiment of the present invention provides a data processing method, see below. Figure 1 The data processing method shown includes steps S11 to S12:

[0048] S11. Obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, number of folds, folding reference and folding direction;

[0049] S12. Using the obtained raw data as the initial value, apply the folding rules of each group in a preset order to obtain encrypted data.

[0050] For example, the folded key is a matrix key, see [link to documentation]. Figure 2 The diagram shows the structure of the folded key. Each column in the matrix represents a set of folding rules, i.e., a complete encryption operation. A represents the folding factor (i.e., the length of the folded unit), S represents the folding start position, E represents the folding end position, C represents the number of folds, and F is the folding method flag, which indicates the folding direction and folding reference. Figure 2 There are always n sets of folding rules.

[0051] 1. Folding factor A

[0052] Defined as a non-zero positive integer, the folding factor determines the length of the folded unit in the folding encryption method. Simultaneously, the folding factor also determines the algorithmic complexity of folding; the smaller the folding factor, the more groups the binary string will have, and the higher the algorithmic cost. For example, if the original binary string is 10110100, and the starting fold position S is set to 1 and the ending fold position E to 8, then folding factors of 1, 2, and 4 can be chosen, and one can be selected as needed. If 2 is chosen as the folding factor, the original binary string will be folded into groups of 10-11-01-00 during folding encryption.

[0053] 2. Folding start position S

[0054] Defined as a non-zero positive integer, used to represent the starting position of the binary string to be folded, for example, starting from position 1.

[0055] 3. Folding end position E

[0056] Defined as a non-zero positive integer, used to represent the termination position of the binary string to be folded, and must satisfy ES greater than or equal to 1.

[0057] 4. Number of folds C

[0058] Defined as a non-zero positive integer, it is used to represent the number of times the binary string to be folded is to be folded. For example, if it is set to 5, then the sub-binary string with the start position S and the end position E in the binary string will be folded 5 times according to the corresponding folding method F.

[0059] 5. Folding method flag F

[0060] This is used to indicate which folding method is used. For example, definition 1 represents the left outward folding method, definition 2 represents the left inward folding method, definition 3 represents the right outward folding method, and definition 4 represents the right inward folding method. The correspondence between the specific folding method flag and the specific folding method (folding direction and folding reference) can be defined by the user.

[0061] It is worth noting that the folded key is not limited to the form of a matrix key; it can also be in other forms, such as arrays or text, and is not limited here. In this embodiment, the folded key can be customized and allocated according to different business scenarios.

[0062] For example, the data processing flow is illustrated using a binary string of length 100 as a prototype. The specific folded encryption process is as follows:

[0063] 1. Based on the above instructions for constructing folded keys, customize the folded key K.

[0064] Depending on actual production needs, binary strings can be encrypted using a combination of local and global encryption, employing different folding methods and varying folding factors and numbers of folds. Following the instructions for constructing the folding key, a custom key can be defined as follows: Figure 3 The diagram shows a folding key for a 100-bit binary string. The first column defines a folding factor of 2, a folding encryption start position of 1, and an end position of 100, meaning the folding applies to the entire binary string. The folding count is 10, and the folding flag is 2, corresponding to a left inward folding method. Therefore, for the entire binary string, it is divided into 50 (even number) groups of two bits each, and 10 even-numbered left inward folds are performed (see the folding process). Figure 7 After encrypting the first column, the encryption process continues with the second column. The second column has a folding factor of 1, a starting position of 50, an ending position of 58, 2 folds, and a folding flag of 3, corresponding to a right outward fold. Therefore, for the 9-bit binary substring from position 50 to 58, it is divided into 9 (odd) groups, with each binary digit as a group, and two odd-numbered right outward folds are performed. After encrypting the second column, the folding encryption of the third and fourth columns is performed sequentially, ultimately forming a ciphertext binary string of the same length (100).

[0065] Compared with existing technologies, the security encryption level of this invention is higher, directly encrypting binary data without requiring key management between the communicating parties, making the possibility of data cracking extremely low. Furthermore, the folding encryption method of this embodiment has good scalability; different folding methods and unfolding operations can be designed for encryption and decryption, and its data computation complexity is low, which helps improve data processing efficiency.

[0066] In a preferred embodiment, based on steps S11 to S12, the method further includes:

[0067] Obtain the encryption matrix, and use the encryption matrix to encrypt the fold key to obtain the matrix ciphertext;

[0068] The matrix ciphertext and the encrypted data are sent to the data recipient.

[0069] Furthermore, the encryption matrix is ​​an invertible matrix, and the determinant of the encryption matrix is ​​1 or -1.

[0070] Specifically, an encryption matrix B, which is invertible and has a determinant of 1 or -1, is selected for encryption of the fold key, such as... Figure 4 The encryption matrix B shown is invertible, and its determinant is either 1 or -1. Using encryption matrix B to encrypt the fold key K, the matrix ciphertext Y of the fold key is calculated, for example, see [link to example]. Figure 5 As shown, the folded key is encrypted using matrix multiplication. By multiplying the encryption matrix B by the folded key K, the matrix ciphertext Y of the folded key is obtained. Finally, the matrix ciphertext Y of the folded key and the encrypted binary string (i.e., the encrypted data) are obtained, while the key matrix B serves as the key to decrypt Y.

[0071] It is worth noting that the matrix ciphertext Y of the folded key and the encrypted binary string can be transmitted to the data receiver through normal channels, while the encryption matrix B must be properly managed to ensure secure transmission.

[0072] In a preferred embodiment, based on any of the above-described embodiments, the folding interval size is an integer multiple of the folding unit length, and the folding interval size is greater than the folding unit length; wherein, the folding interval size refers to the size of the interval formed from the folding start position to the folding end position.

[0073] Specifically, for the fold start position E, the fold end position S, and the fold unit length A, (E-S+1)mod A=0, and A is not equal to (E-S+1).

[0074] In a preferred embodiment, based on any of the above-described embodiments, the folding direction is leftward folding, leftward folding, rightward folding, or rightward folding; the center line of the data fold is the midpoint between the folding start position and the folding end position; after a folding operation is completed, in the newly obtained data sequence, the data located on the same side of the folding reference before this folding operation are separated by the data on the other side, presenting an alternating distribution pattern.

[0075] Specifically, in computers, all data exists in the form of binary strings. Therefore, this implementation defines the following four folding methods for binary strings: left outward folding, left inward folding, right outward folding, and right inward folding, which will be introduced separately below.

[0076] 1. Left outward folding method:

[0077] Taking a folded unit length of 1 as an example, such as Figure 6 As shown, the folding direction is leftward and outward. If the binary string to be encrypted is an odd-numbered string, the data is folded around the center digit as the folding axis (i.e., the folding reference); if the binary string to be encrypted is an even-numbered string, the data is folded around the two center digits of the binary string as the folding axis. It should be noted that in this case, the folding axis is not located on a digit. For example... Figure 6 As shown, the leftmost digit on the right side of the fold axis is folded to the leftmost outermost position, and the remaining data to be folded are inserted sequentially at intervals.

[0078] The way to unfold the folded data is as follows: simply extract the original right-side data that was inserted on the left side in sequence, and then place them together on the far right to unfold the original binary string.

[0079] 2. Left inward folding method:

[0080] Taking a folded unit length of 1 as an example, such as Figure 7 As shown, the folding direction is leftward and inward. Similar to the left outward folding method, the left inward folding method also handles the parity of the binary string differently. First, if the binary string to be encrypted is odd, it is folded around the center digit as the folding axis; if the binary string to be encrypted is even, it is folded around the two center digits as the folding axis. It's important to note that in this case, the folding axis is not located on a digit. For example... Figure 7 As shown, the leftmost digit on the right side of the fold axis is folded to the leftmost inner side, and the remaining data to be folded are inserted sequentially at intervals.

[0081] Expanding folded data: Simply extract the original right-side data that was inserted on the left side, and then place them together on the far right to expand the original binary string.

[0082] 3. Right outward folding method

[0083] Taking a folded unit length of 1 as an example, such as Figure 8 As shown, the folding direction is rightward and outward. The right-outward folding method also handles the parity of the binary string differently. First, if the binary string to be encrypted is odd, the fold is performed around the center digit as the folding axis; if the binary string to be encrypted is even, the fold is performed between the two center digits of the binary string as the folding axis. It's important to note that in this case, the folding axis is not located on a digit. For example... Figure 8 As shown, the rightmost digit on the left side of the fold axis is folded to the rightmost outer edge, and the remaining data to be folded are inserted sequentially at intervals.

[0084] Expanding folded data: Simply extract the original left-side data that was inserted on the right side, and then place them all on the far left to expand the original binary string.

[0085] 4. Right inward folding method

[0086] Taking a folded unit length of 1 as an example, such as Figure 9 As shown, the folding direction is rightward and inward. The right-inward folding method also handles two different cases depending on whether the binary string is odd or even. First, if the binary string to be encrypted is odd, it is folded around the center digit as the folding axis; if the binary string to be encrypted is even, it is folded around the two center digits as the folding axis. Note that in this case, the folding axis is not located on a digit. For example... Figure 9 As shown, the rightmost digit on the left side of the fold axis is folded to the rightmost inner side, and the remaining data to be folded are inserted sequentially at intervals.

[0087] Expanding folded data: Simply extract the original left-side data that was inserted on the right side, and then place them all on the far left to expand the original binary string.

[0088] In a preferred embodiment, based on any of the above-described embodiments, the larger the amount of interactive data of the original data, the larger the length of the folding unit, the fewer the number of folds, and / or the fewer the number of folding rule groups.

[0089] Specifically, the parameters of the fold key can be customized and adjusted according to different business scenarios. For example, for frequently used data, users can customize various methods such as reducing the number of folds, increasing the length of the fold unit, and reducing the number of columns of the fold key to reduce the amount of encryption computation.

[0090] It is worth noting that with the acceleration of digitalization, data security has become a core concern for both enterprises and individuals. Data security involves multi-layered technologies and strategies, including encryption, access control, firewalls, intrusion detection systems, and data backup. Encryption, in particular, is of paramount importance, serving as the foundation for ensuring secure data transmission and storage. By converting information into an unreadable format, it prevents sensitive data from being stolen and tampered with. Compared to existing technologies, this invention utilizes a custom folding key to fold data and generate encrypted data. This not only eliminates the need for complex key management by both communicating parties, reducing security risks, but also lowers the complexity of data processing, thereby improving data processing efficiency. China Mobile Cloud Drive has successfully upgraded its note-sharing and file sharing methods using binary folding encryption technology, making them more flexible and secure. This technology not only improves the efficiency of information transmission but also significantly enhances data confidentiality and resistance to attacks. For enterprises currently using other encryption technologies, introducing binary folding encryption can also optimize the security and efficiency of information sharing and transmission. Therefore, it is easy to see that binary folding encryption has considerable value in the commercial application market.

[0091] See Figure 10 An embodiment of the present invention also provides a data processing method, including steps S13 to S15:

[0092] S13. Obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, number of folds, folding reference and folding direction;

[0093] S14. Receive encrypted data;

[0094] S15. Using the encrypted data as the initial value, apply each set of folding rules in the reverse order of the preset order in the folding key to obtain the original data.

[0095] For example, for encrypted data obtained by any of the data processing methods described above, Figure 3 Taking the folded key K as an example, the decryption is performed sequentially from the rightmost column until the first column is reached. Specifically, Figure 3 The folded key K shown in the matrix, displayed in the rightmost column, has a folding factor of 5, a starting fold position of 21, an ending position of 50, a fold count of 3, and a folding flag of 1 (assuming it corresponds to a left-outward fold). Therefore, for the 30-bit binary substring from positions 21 to 50, it is divided into 6 groups of 5 (an even number), and the left-outward fold is performed 3 times. Then, the second-to-last column is folded and unfolded sequentially until the first column. At this point, the binary string is decrypted and successfully restored to its original state.

[0096] Furthermore, obtaining the preset folding key includes:

[0097] Receive the ciphertext matrix and the encrypted matrix;

[0098] Perform an inverse matrix operation on the encryption matrix to obtain the inverse matrix of the encryption matrix;

[0099] The folded key is obtained by decrypting the ciphertext of the encryption matrix using the inverse of the encryption matrix.

[0100] Specifically, the data sender normally sends the encrypted data (encrypted binary string) and matrix ciphertext Y to the data receiver, and securely sends the encrypted matrix B to the data receiver. After obtaining the matrix ciphertext Y with the fold key, the encrypted binary string, and the encrypted matrix B, the data receiver calculates the inverse of the encrypted matrix B, such as... Figure 11 As shown, Figure 11 yes Figure 4 The inverse matrix corresponding to the encryption matrix B shown is obtained by multiplying the inverse matrix of encryption matrix B with the matrix ciphertext Y of the folded key, as shown below. Figure 12The decrypted fold key K shown is used to fold and unfold the encrypted data to obtain the original data.

[0101] It is worth noting that the specific process of the data processing method described in the embodiments of the present invention can be referred to the working process of the data processing method described in the above embodiments, and will not be repeated here.

[0102] An embodiment of the present invention also provides a data processing method applied to a data sender and a data receiver, the method comprising:

[0103] The data sender obtains a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, folding number, folding reference and folding direction;

[0104] The data sender uses the original data obtained as the initial value, applies the folding rules of each group in a preset order to obtain encrypted data, and sends the encrypted data to the data receiver.

[0105] The data receiver obtains the fold key and the encrypted data;

[0106] The data receiver uses the encrypted data as the initial value and applies each set of folding rules in the reverse order of the preset order in the folding key to obtain the original data.

[0107] In one embodiment, the method further includes: the data sender obtaining an encryption matrix, encrypting the folded key using the encryption matrix to obtain matrix ciphertext, and sending the matrix ciphertext and the encrypted data to the data receiver;

[0108] The data receiver obtains the folded key by: receiving the ciphertext and the encryption matrix; performing an inverse matrix operation on the encryption matrix to obtain the inverse matrix of the encryption matrix; and decrypting the ciphertext using the inverse matrix of the encryption matrix to obtain the folded key.

[0109] In one embodiment, the encryption matrix is ​​an invertible matrix, and the determinant of the encryption matrix is ​​1 or -1.

[0110] In a preferred embodiment, the size of the folding interval is an integer multiple of the length of the folding unit, and the size of the folding interval is greater than the length of the folding unit; wherein, the size of the folding interval refers to the size of the interval formed from the folding start position to the folding end position.

[0111] In one embodiment, the folding direction is leftward folding, leftward folding, rightward folding, or rightward folding; the center line of the data fold is the midpoint between the fold start position and the fold end position; after a folding operation is completed, in the newly obtained data sequence, the data located on the same side of the folding reference before this folding operation are separated by the data on the other side, presenting an alternating distribution pattern.

[0112] In one implementation, the larger the amount of interactive data in the original data, the larger the length of the folding unit, the fewer the number of folds, and / or the fewer the number of folding rule groups.

[0113] It is worth noting that the specific process of the data processing method described in the embodiments of the present invention can refer to the working process of the data processing method described in any of the above embodiments, and will not be repeated here.

[0114] An embodiment of the present invention also provides a data processing system, the system comprising a data sender and a data receiver. The data sender is configured to acquire a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, folding count, folding reference, and folding direction; the data sender is further configured to use the acquired raw data as initial values, apply each set of the folding rules in a preset order to obtain encrypted data, and send the encrypted data to the data receiver;

[0115] The data receiver is used to obtain the folding key and the encrypted data; using the encrypted data as the initial value, it applies each set of folding rules in the reverse order of the preset order in the folding key to obtain the original data.

[0116] In one embodiment, the data sender is further configured to: obtain an encryption matrix, encrypt the fold key using the encryption matrix to obtain matrix ciphertext, and send the matrix ciphertext and the encrypted data to the data receiver;

[0117] The data receiver is configured to obtain the folded key by: receiving matrix ciphertext and encryption matrix; performing an inverse matrix operation on the encryption matrix to obtain the inverse matrix of the encryption matrix; and decrypting the matrix ciphertext using the inverse matrix of the encryption matrix to obtain the folded key.

[0118] In one embodiment, the encryption matrix is ​​an invertible matrix, and the determinant of the encryption matrix is ​​1 or -1.

[0119] In a preferred embodiment, the size of the folding interval is an integer multiple of the length of the folding unit, and the size of the folding interval is greater than the length of the folding unit; wherein, the size of the folding interval refers to the size of the interval formed from the folding start position to the folding end position.

[0120] In one embodiment, the folding direction is leftward folding, leftward folding, rightward folding, or rightward folding; the center line of the data fold is the midpoint between the fold start position and the fold end position; after a folding operation is completed, in the newly obtained data sequence, the data located on the same side of the folding reference before this folding operation are separated by the data on the other side, presenting an alternating distribution pattern.

[0121] In one implementation, the larger the amount of interactive data in the original data, the larger the length of the folding unit, the fewer the number of folds, and / or the fewer the number of folding rule groups.

[0122] It is worth noting that the specific working process of the data processing system described in the embodiments of the present invention can refer to the working process of the data processing method described in any of the above embodiments, and will not be repeated here.

[0123] See Figure 13 An embodiment of the present invention also provides a data processing apparatus, comprising:

[0124] The key acquisition module 21 is used to acquire a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, folding number, folding reference and folding direction;

[0125] The data encryption module 22 is used to obtain encrypted data by applying the folding rules of each group in a preset order, using the obtained raw data as the initial value.

[0126] In one embodiment, the device further includes a key encryption module for obtaining an encryption matrix, encrypting the folded key using the encryption matrix to obtain matrix ciphertext, and sending the matrix ciphertext and the encrypted data to a data receiver.

[0127] In one embodiment, the encryption matrix is ​​an invertible matrix, and the determinant of the encryption matrix is ​​1 or -1.

[0128] In one embodiment, the size of the folding interval is an integer multiple of the length of the folding unit, and the size of the folding interval is greater than the length of the folding unit; wherein, the size of the folding interval refers to the size of the interval formed from the folding start position to the folding end position.

[0129] In one embodiment, the folding direction is leftward folding, leftward folding, rightward folding, or rightward folding; the center line of the data fold is the midpoint between the fold start position and the fold end position; after a folding operation is completed, in the newly obtained data sequence, the data located on the same side of the folding reference before this folding operation are separated by the data on the other side, presenting an alternating distribution pattern.

[0130] In one implementation, the larger the amount of interactive data in the original data, the larger the length of the folding unit, the fewer the number of folds, and / or the fewer the number of folding rule groups.

[0131] It is worth noting that the specific working process of the data processing device described in the embodiments of the present invention can refer to the working process of the data processing method described in any of the above embodiments, and will not be repeated here.

[0132] See Figure 14 An embodiment of the present invention also provides a data processing apparatus, comprising:

[0133] The key determination module 23 is used to obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, and the folding rules define the folding unit length, folding start position, folding end position, folding number, folding reference and folding direction;

[0134] Data receiving module 24 is used to receive encrypted data;

[0135] The data decryption module 25 is used to apply the folding rules of each group in the reverse order of the preset order in the folding key, with the encrypted data as the initial value, to obtain the original data.

[0136] In one implementation, the key determination module 23 is specifically used for:

[0137] Receive the ciphertext matrix and the encrypted matrix;

[0138] Perform an inverse matrix operation on the encryption matrix to obtain the inverse matrix of the encryption matrix;

[0139] The folded key is obtained by decrypting the ciphertext of the encryption matrix using the inverse of the encryption matrix.

[0140] It is worth noting that the specific working process of the data processing device described in the embodiments of the present invention can refer to the working process of the data processing method described in any of the above embodiments, and will not be repeated here.

[0141] See Figure 15This invention also provides a data processing device, including a processor 31, a memory 32, and a computer program stored in the memory 32 and configured to be executed by the processor 31. When the processor 31 executes the computer program, it implements the steps described in the above data processing method embodiments, for example... Figure 1 Steps S11 to S12 described in the text or Figure 10 The steps S13 to S15 described above; or, when the processor 31 executes the computer program, it implements the functions of each module in the above-described device embodiments.

[0142] For example, the computer program can be divided into one or more modules, which are stored in the memory 32 and executed by the processor 31 to complete the present invention. The one or more modules can be a series of computer program instruction segments capable of performing specific functions, which describe the execution process of the computer program in the data processing device. For example, the computer program can be divided into multiple modules. The specific working process of each module can be referred to the working process of the data processing model described in the above embodiments, and will not be repeated here.

[0143] The data processing device may be a desktop computer, laptop, handheld computer, or cloud server, etc. The data processing device may include, but is not limited to, a processor 31 and a memory 32. Those skilled in the art will understand that the data processing device may also include input / output devices, network access devices, buses, etc.

[0144] The processor 31 can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or any conventional processor. The processor 31 is the control center of the data processing device, connecting all parts of the data processing device via various interfaces and lines.

[0145] The memory 32 can be used to store the computer programs and / or modules. The processor 31 implements various functions of the data processing device by running or executing the computer programs and / or modules stored in the memory 32 and calling the data stored in the memory 32. The memory 32 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, at least one application program required for a function (such as image playback function), etc.; the data storage area may store data created according to the use of the mobile phone, etc. In addition, the memory 32 may include high-speed random access memory, and may also include non-volatile memory, such as hard disk, memory, plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0146] If the modules integrated into the data processing device are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, all or part of the processes in the methods of the above embodiments can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when executed by the processor 31, it can implement the steps of the various method embodiments described above. The computer program includes computer program code, which can be in the form of source code, object code, executable files, or certain intermediate forms. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording media, USB flash drives, portable hard drives, magnetic disks, optical disks, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc.

[0147] This invention also provides a computer program product, including a computer program / instructions, which, when executed by a processor, implement the data processing method as described in any of the above embodiments.

[0148] Compared with existing technologies, the data processing method, system, apparatus, device, storage medium, and product provided in this invention, for the data sender: obtains a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, folding count, folding reference, and folding direction; using the obtained original data as the initial value, the folding rules of each set are applied in a preset order to obtain encrypted data. For the data receiver, using the obtained original data as the initial value, the folding rules of each set in the obtained folding key are applied in a preset order to obtain encrypted data. Therefore, this invention, by using a custom folding key to fold data to generate encrypted data, and then using the folding key to unfold the encrypted data during decryption, not only eliminates the need for complex key management by both communicating parties, reducing security risks, but also reduces the complexity of data computation, thereby improving data processing efficiency.

[0149] The above description represents the preferred embodiments of the present invention. It should be noted that those skilled in the art can make various improvements and modifications without departing from the principles of the present invention, and these improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A data processing method, characterized in that, include: Obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, number of folds, folding reference and folding direction; Using the obtained raw data as the initial value, the folding rules of each group are applied in a preset order to obtain encrypted data.

2. The data processing method as described in claim 1, characterized in that, Also includes: Obtain the encryption matrix, and use the encryption matrix to encrypt the fold key to obtain the matrix ciphertext; The matrix ciphertext and the encrypted data are sent to the data recipient.

3. The data processing method as described in claim 2, characterized in that, The encryption matrix is ​​an invertible matrix, and the determinant of the encryption matrix is ​​1 or -1.

4. The data processing method as described in claim 1, characterized in that, The size of the folding interval is an integer multiple of the length of the folding unit, and the size of the folding interval is greater than the length of the folding unit; wherein, the size of the folding interval refers to the size of the interval formed from the folding start position to the folding end position.

5. The data processing method as described in claim 1, characterized in that, The folding direction is either folding inward to the left, folding outward to the left, folding inward to the right, or folding outward to the right. The center line of data folding is the midpoint between the folding start position and the folding end position. After a folding operation is completed, in the newly obtained data sequence, the data that was on the same side of the folding reference before this folding operation is separated by the data on the other side, presenting an alternating distribution pattern.

6. The data processing method as described in claim 1, characterized in that, The larger the amount of interactive data in the original data, the larger the length of the folding unit, the fewer the number of folds, and / or the fewer the number of folding rule groups.

7. A data processing method, characterized in that, include: Obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, number of folds, folding reference and folding direction; Receive encrypted data; Using the encrypted data as the initial value, the original data is obtained by applying the folding rules of each group in the reverse order of the preset order in the folding key.

8. The data processing method as described in claim 7, characterized in that, The process of obtaining the preset folding key includes: Receive the ciphertext matrix and the encrypted matrix; Perform an inverse matrix operation on the encryption matrix to obtain the inverse matrix of the encryption matrix; The folded key is obtained by decrypting the ciphertext of the encryption matrix using the inverse of the encryption matrix.

9. A data processing method, characterized in that, include: The data sender obtains a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, folding number, folding reference and folding direction; The data sender uses the original data obtained as the initial value, applies the folding rules of each group in a preset order to obtain encrypted data, and sends the encrypted data to the data receiver. The data receiver obtains the fold key and the encrypted data; The data receiver uses the encrypted data as the initial value and applies each set of folding rules in the reverse order of the preset order in the folding key to obtain the original data.

10. A data processing system, characterized in that, It includes a data sender and a data receiver, wherein the data sender is used to perform the data processing method as described in any one of claims 1 to 6, and the data receiver is used to perform the data processing method as described in claim 7 or 8.

11. A data processing apparatus, characterized in that, include: A key acquisition module is used to acquire a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, number of folds, folding reference and folding direction; The data encryption module is used to obtain encrypted data by applying the folding rules of each group in a preset order, using the obtained raw data as the initial value.

12. A data processing apparatus, characterized in that, include: A key determination module is used to obtain a preset folding key; wherein, the folding key includes at least one set of folding rules, the folding rules defining the folding unit length, folding start position, folding end position, folding number, folding reference and folding direction; The data receiving module is used to receive encrypted data; The data decryption module is used to apply the folding rules of each group in the reverse order of the preset order in the folding key, with the encrypted data as the initial value, to obtain the original data.

13. A data processing device, characterized in that, It includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor, when executing the computer program, implements the data processing method as described in any one of claims 1 to 8.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored computer program, wherein, when the computer program is executed, it controls the device on which the computer-readable storage medium is located to perform the data processing method as described in any one of claims 1 to 8.

15. A computer program product comprising a computer program / instructions, characterized in that, When the computer program / instructions are executed by the processor, they implement the data processing method as described in any one of claims 1 to 8.

Images