A data distributed mapping encryption storage method and system

Abstract

The application relates to a data distributed mapping encryption storage method and system, which comprises the following steps: dividing data into n sub-data packets with sequencing according to a set data segmentation rule, setting a mapping character for each sub-data packet, generating a check program according to a combination rule of combining the mapping characters into combined data, and combining the check program with the last sub-data packet to form a new sub-data packet; when reading data, n-1 sub-data packets are read one by one according to sequencing by means of the first n-1 storage addresses, and n-1 mapping characters are obtained; the n-1 mapping characters are sent to a storage address corresponding to the last sub-data packet for storage, a check program detects the n-1 mapping characters to obtain a mapping character corresponding to the nth sub-data packet, and the n mapping characters are combined and checked; the method is completely different from a conventional encryption and decryption idea, is more intelligent, can automatically trigger an alarm, has good encryption reliability, has low development difficulty, and has less development time consumption.

Description

Technical Field

[0001] This invention relates to the field of distributed data storage technology, and more specifically, to a distributed data mapping encrypted storage method and system. Background Technology

[0002] Distributed storage systems distribute data across multiple independent devices. Traditional network storage systems use a centralized storage server to store all data, making the storage server the bottleneck for system performance and a focal point for reliability and security, thus failing to meet the needs of large-scale storage applications. Distributed network storage systems employ a scalable system architecture, utilizing multiple storage servers to share the storage load and location servers to locate stored information. This not only improves system reliability, availability, and access efficiency but also facilitates expansion. In conventional distributed storage methods, data is typically divided into multiple data packets according to rules, then stored through different paths, and the storage address is returned. Data is usually encrypted using encryption algorithms. However, conventional encryption methods offer low security for data, and developing new encryption algorithms is difficult, time-consuming, and costly. Therefore, a distributed data mapping encryption storage method and system that can better solve this problem is needed. Summary of the Invention

[0003] The technical problem to be solved by the present invention is to provide a data distributed mapping encrypted storage method and a data distributed mapping encrypted storage system, in view of the above-mentioned defects of the prior art.

[0004] The technical solution adopted by this invention to solve its technical problem is: Construct a distributed data mapping encrypted storage method, which includes the following steps: Step 1: Divide the data to be stored into n sorted sub-data packets according to the set data segmentation rules. According to the mapping rules, set a mapping character for each sub-data packet. All the mapping characters corresponding to the data to be stored can be combined into a combined data with a set meaning. Step 2: Based on the combination rules of the mapped character combinations into combined data, generate a verification program, and combine the verification program with the last sub-data packet to form a new sub-data packet; Step 3: Distribute the n sub-data packets processed in Step 2 on the system and receive the n storage addresses fed back by the system; Step 4: When reading data, rely on the first n-1 storage addresses to read n-1 sub-data packets one by one in order, and obtain n-1 mapping characters according to the mapping rules; Step 5: Send n-1 mapping characters to the storage address corresponding to the last sub-data packet for storage. After the verification program detects n-1 mapping characters, it obtains the mapping character corresponding to the nth sub-data packet based on the mapping rules, and combines and verifies the n mapping characters. If the verification passes, it sends the nth sub-data packet to the sender of the n-1 mapping characters; otherwise, it sends an alarm command to the outside.

[0005] In the data distributed mapping encrypted storage method of the present invention, in step five, when the verification program performs verification: Combine the n mapped characters in order; The combined data is subjected to meaning recognition. If a meaning is found, the verification is considered successful; otherwise, it fails.

[0006] The data distributed mapping encrypted storage method of the present invention includes an alarm address in the generated verification program in step two. In step five, when sending an alarm command, the alarm command is sent to the stored alarm address.

[0007] The data distributed mapping encrypted storage method of the present invention, wherein in step one: While setting the mapping character for each sub-data packet, the sub-data packet and the mapping character are stored in pairs in the mapping rule base; Step four also includes a method: When obtaining n-1 mapping characters based on mapping rules, if a sub-data packet is missing or erroneous, resulting in the inability to obtain the corresponding mapping character, the sub-data packet is matched in the mapping rule base, and the sub-data packet with the highest similarity in the mapping rule base is used to replace the missing or erroneous sub-data packet, and the corresponding mapping character is returned.

[0008] The data distributed mapping encrypted storage method of the present invention further includes the following steps: Step 6: Combine the n sub-data packets to form complete data.

[0009] A distributed data mapping encrypted storage system is applied to the distributed data mapping encrypted storage method described above, comprising a distributed storage unit, a mapping processing unit, a data reading unit, and a distributed storage module. The distributed storage unit is used to divide the data to be stored into n sorted sub-data packets according to the set data segmentation rules. According to the mapping rules, it is also used to distribute the n sub-data packets processed by the mapping processing unit in the distributed storage module and return n storage addresses. The mapping processing unit is used to set mapping characters for each sub-data packet. All the mapping characters corresponding to the data to be stored can be combined into a combined data with a set meaning. It is also used to generate a verification program according to the combination rules of the mapping characters to form combined data, and combine the verification program with the last sub-data packet to form a new sub-data packet. The data reading unit, when reading data, reads n-1 sub-data packets one by one according to the order of the first n-1 storage addresses, and obtains n-1 mapping characters according to the mapping rules; sends the n-1 mapping characters to the storage address corresponding to the last sub-data packet for storage; after the verification program detects the n-1 mapping characters, it obtains the mapping character corresponding to the nth sub-data packet according to the mapping rules, and combines and verifies the n mapping characters; if the verification passes, it sends the nth sub-data packet to the sender of the n-1 mapping characters; otherwise, it sends an alarm command to the outside.

[0010] The data distributed mapping encrypted storage method of the present invention, wherein, when the verification program performs verification: Combine n mapped characters in a sorted manner; identify the meaning of the combined data; if it has meaning, the verification is considered successful; otherwise, it fails.

[0011] The data distributed mapping encrypted storage method of the present invention includes an alarm address in the generated verification program; When the verification program sends an alarm command, it sends the alarm command to the stored alarm address.

[0012] The data distributed mapping encrypted storage method of the present invention further includes a mapping rule base in the system. The mapping rule library is used to store sub-data packets and mapping characters in pairs while setting mapping characters for each sub-data packet; When the data reading unit obtains n-1 mapping characters based on the mapping rules, if the sub-data packet is missing or incorrect, resulting in the inability to obtain the corresponding mapping character, the sub-data packet is matched in the mapping rule library, and the sub-data packet with the highest similarity in the mapping rule library is used to replace the missing or incorrect sub-data packet, and the corresponding mapping character is fed back.

[0013] The data distributed mapping encrypted storage method of the present invention further includes a data reading unit used to combine n sub-data packets to form complete data.

[0014] The beneficial effects of this invention are as follows: by applying the method of this application, the mapped character is used as a verification code, and the verification program is used to automatically identify and verify it on the distributed storage side. This method is completely different from the conventional encryption and decryption approach, is more intelligent, can automatically trigger alarms, has good encryption reliability, and the data structure is extremely simple. It has good anti-interference ability, and at the same time, it is easy to develop and takes less time. Attached Figure Description

[0015] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the present invention will be further described below in conjunction with the accompanying drawings and embodiments. The drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort: Figure 1 This is a flowchart of a preferred embodiment of the data distributed mapping encrypted storage method of the present invention; Figure 2 This is a block diagram illustrating the principle of a data distributed mapping encrypted storage system according to a preferred embodiment of the present invention. Detailed Implementation

[0016] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, a clear and complete description will be provided below in conjunction with the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative effort are within the protection scope of the present invention.

[0017] The preferred embodiment of the data distributed mapping encrypted storage method of the present invention, such as... Figure 1 As shown, it includes the following steps: S01: Divide the data to be stored into n sorted sub-data packets according to the set data segmentation rules. According to the mapping rules, set a mapping character for each sub-data packet. All the mapping characters corresponding to the data to be stored can be combined into a combined data with a set meaning. S02: Based on the combination rules of the mapped character combination into combined data, generate a verification program, and combine the verification program with the last sub-data packet to form a new sub-data packet; S03: Distribute the n sub-data packets processed in step two on the system and receive the n storage addresses fed back by the system; S04: When reading data, rely on the first n-1 storage addresses to read n-1 sub-data packets one by one in order, and obtain n-1 mapping characters according to the mapping rules; S05: Send n-1 mapping characters to the storage address corresponding to the last sub-data packet for storage. After the verification program detects n-1 mapping characters, it obtains the mapping character corresponding to the nth sub-data packet based on the mapping rules, and combines and verifies the n mapping characters. If the verification passes, it sends the nth sub-data packet to the sender of the n-1 mapping characters; otherwise, it sends an alarm command to the outside. S06: Combine the n sub-data packets to form complete data.

[0018] The method described in this application uses the mapped character as a verification code and relies on a verification program to automatically identify and verify it on the distributed storage side. This method is completely different from conventional encryption and decryption approaches, is more intelligent, can automatically trigger alarms, has good encryption reliability, has an extremely simple data structure, has good anti-interference capabilities, and is easy and time-saving to develop.

[0019] Preferably, when the verification program performs verification, it can combine the n mapped characters in a sorted manner; then, it can identify the meaning of the combined data. If the data has meaning, the verification is considered to have passed; otherwise, it fails. It should be noted that the meaning of the setting in this application can be in the form of sentences, phrases, etc. with certain semantics; the purpose of adopting this method is to eliminate the need for comparison (reduce data back-and-forth interaction), thereby improving the intelligence of the program and reducing unnecessary resource and time consumption.

[0020] For alarms, the generated verification program can include the alarm address, so that when an alarm command is sent, it will be sent to the stored alarm address.

[0021] By applying the method of this application, while setting the mapping character for each sub-data packet, the sub-data packets and the mapping character can also be stored in the mapping rule base in pairs; With a mapping rule base as the foundation, when obtaining n-1 mapping characters by relying on mapping rules, if a sub-data packet is missing or incorrect, resulting in the inability to obtain the corresponding mapping character, the sub-data packet is matched in the mapping rule base, and the sub-data packet with the highest similarity in the mapping rule base is used to replace the missing or incorrect sub-data packet, and the corresponding mapping character is fed back; thus, the purpose of checking and correcting the read sub-data packets is achieved. This is also a core function of this application. This kind of automatic checking and correction is something that existing encryption methods cannot achieve. A distributed data mapping encrypted storage system is applied to the distributed data mapping encrypted storage method described above, such as... Figure 2 As shown, it includes a distributed storage unit 100, a mapping processing unit 101, a data reading unit 102, and a distributed storage module 103; The distributed storage unit 100 is used to divide the data to be stored into n sorted sub-data packets according to the set data segmentation rules. According to the mapping rules, it is also used to distribute the n sub-data packets processed by the mapping processing unit in the distributed storage module 103 and return n storage addresses. The mapping processing unit 101 is used to set mapping characters for each sub-data packet. All the mapping characters corresponding to the data to be stored can be combined into a combined data with a set meaning. It is also used to generate a verification program according to the combination rules of the mapping characters to form combined data, and combine the verification program with the last sub-data packet to form a new sub-data packet. When reading data, the data reading unit 102 reads n-1 sub-data packets one by one according to the order of the first n-1 storage addresses, and obtains n-1 mapping characters according to the mapping rules. The n-1 mapping characters are sent to the storage address corresponding to the last sub-data packet for storage. After the verification program detects the n-1 mapping characters, it obtains the mapping character corresponding to the nth sub-data packet according to the mapping rules, and combines and verifies the n mapping characters. If the verification is successful, the nth sub-data packet is sent to the sender of the n-1 mapping characters; otherwise, an alarm command is sent to the outside. The n sub-data packets are combined to form complete data.

[0022] The method described in this application uses mapped characters as checksums and relies on a verification program for automatic identification and verification at a distributed storage terminal. This approach is completely different from conventional encryption and decryption methods, is more intelligent, can automatically trigger alarms, has high encryption reliability, an extremely simple data structure, good anti-interference capabilities, and is also low in development difficulty and time. Preferably, when the verification program performs verification, it can combine the n mapped characters in a sorted manner; then, it can identify the meaning of the combined data. If the data has meaning, the verification is considered to have passed; otherwise, it fails. It should be noted that the meaning of the setting in this application can be in the form of sentences, phrases, etc. with certain semantics; the purpose of adopting this method is to eliminate the need for comparison (reduce data back-and-forth interaction), thereby improving the intelligence of the program and reducing unnecessary resource and time consumption.

[0023] For alarms, the generated verification program can include the alarm address, so that when an alarm command is sent, it will be sent to the stored alarm address.

[0024] By applying the method of this application, while setting the mapping character for each sub-data packet, the sub-data packets and the mapping character can also be stored in the mapping rule base in pairs. With the mapping rule base 104 as a foundation, when obtaining n-1 mapping characters by relying on mapping rules, if a sub-data packet is missing or erroneous, resulting in the inability to obtain the corresponding mapping character, the sub-data packet is matched in the mapping rule base, and the sub-data packet with the highest similarity in the mapping rule base is used to replace the missing or erroneous sub-data packet, and the corresponding mapping character is fed back; thus, the purpose of checking and correcting the read sub-data packets is achieved. This is also a core function of this application. This kind of automatic checking and correction is something that existing encryption methods cannot achieve.

[0025] It should be understood that those skilled in the art can make improvements or modifications based on the above description, and all such improvements and modifications should fall within the protection scope of the appended claims.

Claims

1. A method for distributed data mapping and encrypted storage, characterized in that, Includes the following steps: Step 1: Divide the data to be stored into n sorted sub-data packets according to the set data segmentation rules. According to the mapping rules, set a mapping character for each sub-data packet. All the mapping characters corresponding to the data to be stored can be combined into a combined data with a set meaning. Step 2: Based on the combination rules of the mapped character combinations into combined data, generate a verification program, and combine the verification program with the last sub-data packet to form a new sub-data packet; Step 3: Distribute the n sub-data packets processed in Step 2 on the system and receive the n storage addresses fed back by the system; Step 4: When reading data, rely on the first n-1 storage addresses to read n-1 sub-data packets one by one in order, and obtain n-1 mapping characters according to the mapping rules; Step 5: Send n-1 mapping characters to the storage address corresponding to the last sub-data packet for storage. After the verification program detects n-1 mapping characters, it obtains the mapping character corresponding to the nth sub-data packet based on the mapping rules, and combines and verifies the n mapping characters. If the verification passes, it sends the nth sub-data packet to the sender of the n-1 mapping characters; otherwise, it sends an alarm command to the outside.

2. The data distributed mapping encrypted storage method according to claim 1, characterized in that, In step five, when the verification program performs the verification: Combine the n mapped characters in order; The combined data is subjected to meaning recognition. If a meaning is found, the verification is considered successful; otherwise, it fails.

3. The data distributed mapping encrypted storage method according to claim 1, characterized in that, In step two, the generated verification program contains an alarm address; In step five, when sending an alarm command, the alarm command is sent to the stored alarm address.

4. The data distributed mapping encrypted storage method according to claim 1, characterized in that, In step one: While setting the mapping character for each sub-data packet, the sub-data packet and the mapping character are stored in pairs in the mapping rule base; Step four also includes a method: When obtaining n-1 mapping characters based on mapping rules, if a sub-data packet is missing or erroneous, resulting in the inability to obtain the corresponding mapping character, the sub-data packet is matched in the mapping rule base, and the sub-data packet with the highest similarity in the mapping rule base is used to replace the missing or erroneous sub-data packet, and the corresponding mapping character is returned.

5. The data distributed mapping encrypted storage method according to claim 1, characterized in that, The method further includes the following steps: Step 6: Combine the n sub-data packets to form complete data.

6. A data distributed mapping encrypted storage system, applied to the data distributed mapping encrypted storage method as described in any one of claims 1-5, characterized in that, It includes distributed storage units, mapping processing units, data reading units, and distributed storage modules; The distributed storage unit is used to divide the data to be stored into n sorted sub-data packets according to the set data segmentation rules. According to the mapping rules, it is also used to distribute the n sub-data packets processed by the mapping processing unit in the distributed storage module and return n storage addresses. The mapping processing unit is used to set mapping characters for each sub-data packet. All the mapping characters corresponding to the data to be stored can be combined into a combined data with a set meaning. It is also used to generate a verification program according to the combination rules of the mapping characters to form combined data, and combine the verification program with the last sub-data packet to form a new sub-data packet. The data reading unit, when reading data, reads n-1 sub-data packets one by one according to the order of the first n-1 storage addresses, and obtains n-1 mapping characters according to the mapping rules; sends the n-1 mapping characters to the storage address corresponding to the last sub-data packet for storage; after the verification program detects the n-1 mapping characters, it obtains the mapping character corresponding to the nth sub-data packet according to the mapping rules, and combines and verifies the n mapping characters; if the verification passes, it sends the nth sub-data packet to the sender of the n-1 mapping characters; otherwise, it sends an alarm command to the outside.

7. The data distributed mapping encrypted storage system according to claim 6, characterized in that, When the verification procedure performs verification: Combine n mapped characters in a sorted manner; identify the meaning of the combined data; if it has meaning, the verification is considered successful; otherwise, it fails.

8. The data distributed mapping encrypted storage system according to claim 6, characterized in that, The generated verification program contains alarm addresses; When the verification program sends an alarm command, it sends the alarm command to the stored alarm address.

9. The data distributed mapping encrypted storage system according to claim 6, characterized in that, The system also includes a mapping rule base; The mapping rule library is used to store sub-data packets and mapping characters in pairs while setting mapping characters for each sub-data packet; When the data reading unit obtains n-1 mapping characters based on the mapping rules, if the sub-data packet is missing or incorrect, resulting in the inability to obtain the corresponding mapping character, the sub-data packet is matched in the mapping rule library, and the sub-data packet with the highest similarity in the mapping rule library is used to replace the missing or incorrect sub-data packet, and the corresponding mapping character is fed back.

10. The data distributed mapping encrypted storage system according to claim 6, characterized in that, The data reading unit is also used to combine n sub-data packets to form complete data.

Images