A privacy protection and storage method based on high-speed encryption and decryption algorithm
By building data pools, sharding, index set encryption and dynamic key update methods, the problem of insufficient security of data storage and transmission in the prior art is solved, high-speed encryption and decryption is realized, and high data security is ensured.
Patent Information
- Application Number
- CN202410491057.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-04-23
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2044-04-23
AI Technical Summary
The existing technology is difficult to effectively implement high-speed encryption and decryption algorithms, resulting in insufficient security in data storage and transmission, and cannot meet the modern Internet's needs for data privacy protection.
By building at least two sets of data pools, sharding and splitting data, establishing index sets and encrypting them, dynamically updating the keys to ensure dual authentication and encryption of data, using asymmetric key groups to generate benchmark keys, realizing high-speed data Encrypt and decrypt.
It improves security during data exchange, ensures dynamic encryption and dual-factor authentication of data, and enhances the security of data storage and transmission.
Smart Images

Figure CN118228315B_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of data encryption, and in particular relates to a privacy protection and storage method based on a high-speed encryption and decryption algorithm. Background Art
[0002] With the development of the Internet, data security and privacy protection have received more and more attention. Data encryption is a commonly used data protection method that can convert data into unreadable ciphertext to prevent unauthorized access and tampering.
[0003] In view of this, it is urgent to propose a privacy protection and storage method based on high-speed encryption and decryption algorithm. Summary of the invention
[0004] The present invention provides a privacy protection and storage method based on a high-speed encryption and decryption algorithm to achieve data storage and encryption.
[0005] A first aspect of the present invention provides a privacy protection and storage method based on a high-speed encryption and decryption algorithm, comprising the following steps:
[0006] S1. Obtain original data;
[0007] S2. Construct at least two groups of data pools, distribute the first data pool to the holder of the original data, and distribute the second data pool to the storage end of the original data;
[0008] S3, fragmenting the original data into a plurality of sub-data according to a preset fragmentation rule, and constructing a first data sequence of the sub-data;
[0009] S4, dividing the first data sequence into multiple subsequences according to a preset cutting rule;
[0010] S5, storing the first data sequence, the subsequence and the sub-data in the second storage pool;
[0011] S6. Establishing a first index set between the first data sequence and the subsequence;
[0012] S7, establishing a second index set between the subsequence and the sub-data;
[0013] S8, writing the first index set and the second index set into the sub-data after encryption, and returning the sub-data to the first storage pool;
[0014] S9: back up and store the sub-data in the second storage pool.
[0015] Furthermore, in step S8, performing encryption includes the following steps:
[0016] Constructing a first array about the first index set and a second array about the second index set, and writing the first array and the second array to a preset position of the first sub-data written to the first data pool with a reference key;
[0017] Whenever another sub-data is written into the first data pool, the reference key is updated to a dynamic key, and the dynamic key is used as the reference key for the next writing.
[0018] Further, the step of updating the reference key to a dynamic key includes:
[0019] The corresponding indexes of the sub-data previously written in the first index set and the second index set are deleted or updated to generate new first array and second array.
[0020] Furthermore, if the update is done through a placeholder, the following steps are included:
[0021] When any sub-data is removed from the second data pool, the corresponding indexes in the first index set and the second index set are deleted and a placeholder value is generated to fill the data position where the original index is located, and at least the preset value is written into the adjacent positions of the first array and the second array respectively, and the first array and the second array are updated.
[0022] Furthermore, the first index set includes indexes between the first data sequence and each of the subsequences, and the second index set includes indexes between the subsequence and each of the sub-data.
[0023] Furthermore, when obtaining the base key, it also includes obtaining an asymmetric key group related to the base key, the asymmetric key group is used to generate the base key, and its construction process includes the following steps:
[0024] Distribute a first key and a second key to the first data pool and the second data pool respectively;
[0025] When any sub-data is written into the first data pool, a preset value is written into the position of the second key corresponding to the sub-data in the second array to generate a second update key;
[0026] Writing a preset value into a preset position of the first key to generate a first updated key;
[0027] The encryption of the first array and the second array after the sub-data is written is obtained by the first update key and the second update key.
[0028] A second aspect of the present invention provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, it is suitable for implementing the method provided by the first aspect of the present invention.
[0029] According to a third aspect of the present invention, there is provided a storage medium having a computer program stored thereon, which, when executed by a processor, is suitable for implementing the method provided by the first aspect of the present invention.
[0030] The above technical solution of the present invention has the following advantages compared with the prior art:
[0031] The present invention realizes dynamic encryption and dual authentication by using data changes during data exchange to ensure the security of data exchange. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Figure 1 It is a schematic diagram of the steps of the method provided by an embodiment of the present invention.
[0033] Figure 2 It is a schematic diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0034] In order to be able to understand the features and technical contents of the embodiments of the present disclosure in more detail, the implementation of the embodiments of the present disclosure is described in detail below in conjunction with the accompanying drawings. The attached drawings are for reference only and are not used to limit the embodiments of the present disclosure. In the following technical description, for the convenience of explanation, a full understanding of the disclosed embodiments is provided through multiple details. However, one or more embodiments can still be implemented without these details. In other cases, to simplify the drawings, well-known structures and devices can be simplified for display. Example
[0035] A first aspect of the present invention provides a privacy protection and storage method based on a high-speed encryption and decryption algorithm, comprising the following steps:
[0036] S1. Obtain original data;
[0037] S2. Construct at least two groups of data pools, distribute the first data pool to the holder of the original data, and distribute the second data pool to the storage end of the original data;
[0038] S3, fragmenting the original data into a plurality of sub-data according to a preset fragmentation rule, and constructing a first data sequence of the sub-data;
[0039] S4, dividing the first data sequence into multiple subsequences according to a preset cutting rule;
[0040] S5, storing the first data sequence, the subsequence and the sub-data in the second storage pool;
[0041] S6. Establishing a first index set between the first data sequence and the subsequence;
[0042] S7, establishing a second index set between the subsequence and the sub-data;
[0043] S8, writing the first index set and the second index set into the sub-data after encryption, and returning the sub-data to the first storage pool;
[0044] S9: back up and store the sub-data in the second storage pool.
[0045] Furthermore, in step S8, performing encryption includes the following steps:
[0046] Constructing a first array about the first index set and a second array about the second index set, and writing the first array and the second array to a preset position of the first sub-data written to the first data pool with a reference key;
[0047] Whenever another sub-data is written into the first data pool, the reference key is updated to a dynamic key, and the dynamic key is used as the reference key for the next writing.
[0048] Further, the step of updating the reference key to a dynamic key includes:
[0049] The corresponding indexes of the sub-data previously written in the first index set and the second index set are deleted or updated to generate new first array and second array.
[0050] Furthermore, if the update is done through a placeholder, the following steps are included:
[0051] When any sub-data is removed from the second data pool, the corresponding indexes in the first index set and the second index set are deleted and a placeholder value is generated to fill the data position where the original index is located, and at least the preset value is written into the adjacent positions of the first array and the second array respectively, and the first array and the second array are updated.
[0052] Furthermore, the first index set includes indexes between the first data sequence and each of the subsequences, and the second index set includes indexes between the subsequence and each of the sub-data.
[0053] Furthermore, when obtaining the base key, it also includes obtaining an asymmetric key group related to the base key, the asymmetric key group is used to generate the base key, and its construction process includes the following steps:
[0054] Distribute a first key and a second key to the first data pool and the second data pool respectively;
[0055] When any sub-data is written into the first data pool, a preset value is written into the position of the second key corresponding to the sub-data in the second array to generate a second update key;
[0056] Writing a preset value into a preset position of the first key to generate a first updated key;
[0057] The encryption of the first array and the second array after the sub-data is written is obtained by the first update key and the second update key. Example
[0058] Combination Figure 2 As shown, an embodiment of the present disclosure provides an electronic device, including a processor (processor) 30 and a memory (memory) 31.
[0059] Optionally, the device may further include a communication interface (CommunicationInterface) 32 and a bus 33. The processor 30, the communication interface 32, and the memory 31 may communicate with each other through the bus 33. The communication interface 32 may be used for information transmission. The processor 30 may call the logic instructions in the memory 31 to execute the privacy protection and storage method based on the high-speed encryption and decryption algorithm of the above embodiment.
[0060] An embodiment of the present disclosure provides a storage medium storing computer executable instructions, wherein the computer executable instructions are configured to execute the above-mentioned privacy protection and storage method based on the high-speed encryption and decryption algorithm.
[0061] The above-mentioned storage medium may be a transient computer-readable storage medium or a non-transient computer-readable storage medium. Non-transient storage media include: USB flash drives, mobile hard disks, read-only memories (ROMs), random access memories (RAMs), magnetic disks or optical disks, and other media that can store program codes, which may also be transient storage media.
[0062] The above description and the accompanying drawings fully illustrate the embodiments of the present disclosure so that those skilled in the art can practice them. Other embodiments may include structural, logical, electrical, process and other changes. The embodiments represent only possible changes. Unless explicitly required, separate components and functions are optional, and the order of operations may vary. Parts and features of some embodiments may be included in or replace parts and features of other embodiments. Moreover, the words used in this application are only used to describe the embodiments and are not used to limit the claims. As used in the description of the embodiments and the claims, unless the context clearly indicates, the singular forms of "a", "an" and "the" are intended to include plural forms as well. Similarly, the term "and / or" as used in this application refers to any and all possible combinations of one or more associated listings. In addition, when used in this application, the term "comprise" and its variants "comprises" and / or comprising refer to the presence of stated features, wholes, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or groups thereof. In the absence of further restrictions, the elements defined by the sentence "including one..." do not exclude the presence of other identical elements in the process, method or device including the elements. In this article, each embodiment may focus on the differences from other embodiments, and the same and similar parts between the embodiments may refer to each other. For the methods, products, etc. disclosed in the embodiments, if they correspond to the method part disclosed in the embodiments, then the relevant parts can refer to the description of the method part.
Claims
1. A privacy protection and storage method based on a high-speed encryption and decryption algorithm, characterized in that: The steps include: S1. Obtain original data; S2. Construct at least two groups of data pools, distribute the first data pool to the holder of the original data, and distribute the second data pool to the storage end of the original data; S3, fragmenting the original data into a plurality of sub-data according to a preset fragmentation rule, and constructing a first data sequence of the sub-data; S4, dividing the first data sequence into multiple subsequences according to a preset cutting rule; S5, storing the first data sequence, the subsequence and the sub-data in the second data pool; S6. Establishing a first index set between the first data sequence and the subsequence; S7, establishing a second index set between the subsequence and the sub-data; S8, writing the first index set and the second index set into the sub-data after encryption, and returning the sub-data to the first data pool; Performing encryption involves the following steps: Constructing a first array about the first index set and a second array about the second index set, and writing the first array and the second array to a preset position of the first sub-data written to the first data pool with a reference key; Whenever another sub-data is written into the first data pool, the reference key is updated to a dynamic key, and the dynamic key is used as the reference key for the next writing; S9. Back up and store the sub-data in the second data pool.
2. The privacy protection and storage method based on high-speed encryption and decryption algorithm according to claim 1 is characterized in that: The step of updating the reference key to a dynamic key comprises: The corresponding indexes of the sub-data previously written in the first index set and the second index set are deleted or updated to generate new first array and second array.
3. The privacy protection and storage method based on high-speed encryption and decryption algorithm according to claim 2 is characterized in that: If the update is done through a placeholder, the following steps are included: When any sub-data is removed from the second data pool, the corresponding indexes in the first index set and the second index set are deleted, and a placeholder value is generated to fill the data position where the original index is located, and a preset value is written to the adjacent positions of the first array and the second array respectively, and the first array and the second array are updated.
4. The privacy protection and storage method based on high-speed encryption and decryption algorithm according to claim 3 is characterized in that: The first index set includes indexes between the first data sequence and each of the subsequences, and the second index set includes indexes between the subsequence and each of the sub-data.
5. The privacy protection and storage method based on high-speed encryption and decryption algorithm according to claim 4 is characterized in that: When obtaining the base key, it also includes obtaining an asymmetric key group related to the base key, the asymmetric key group is used to generate the base key, and its construction process includes the following steps: Distribute a first key and a second key to the first data pool and the second data pool respectively; When any sub-data is written into the first data pool, a preset value is written into the position of the second key corresponding to the sub-data in the second array to generate a second update key; Writing a preset value into a preset position of the first key to generate a first updated key; The encryption of the first array and the second array after the sub-data is written is obtained by the first update key and the second update key.
6. An electronic device, characterized in that It includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the privacy protection and storage method based on the high-speed encryption and decryption algorithm as described in any one of claims 1 to 5.
7. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, it is suitable for implementing the privacy protection and storage method based on the high-speed encryption and decryption algorithm as described in any one of claims 1-5.
Citation Information
Patent Citations
Data migration method, device, electronic equipment and readable storage medium
CN113836116A
Distributed object storage method and device, electronic equipment and readable storage medium
CN113886331A
Data transmission method and device, electronic equipment and storage medium
CN115801315A
Distributed high-speed encryption calculation method
CN117201198A
Permutation-based coding for data storage and data transmission
US20220149865A1
