Method for secure encryption storage of geopolymer hydrodynamic erosion data

Abstract

This invention relates to the field of storage system technology, specifically a secure encrypted storage method for geopolymer erosion data, comprising the following steps: extracting aluminosilicate ratio, alkaline activator concentration, water flow velocity, and geopolymer erosion depth to obtain ordered erosion ciphertext data; performing character hash mapping transformation on the aluminosilicate ratio and alkaline activator concentration to obtain mapping values; and establishing an erosion inverted index tree based on the ordered erosion ciphertext data and mapping values. In this invention, a retrieval path data set is formed by splicing related parent nodes and adjacent sibling nodes, giving the retrieval behavior a path camouflage effect, making it difficult for external observers to directly distinguish between the true hit trajectory and the accompanying trajectory. After reading, random displacement rearrangement transformation operations are performed on all data blocks and overwritten back to the storage area, causing the storage state to continuously change after access. Historical access traces, fixed-location exposure traces, and repeated call exposure traces are all compressed, thereby improving the confidentiality effect.

Description

Technical Field

[0001] This invention relates to the field of storage system technology, and in particular to a secure encrypted storage method for geopolymer hydroerosion data. Background Technology

[0002] Storage system technology mainly revolves around data writing, data organization, data addressing, data reading, data protection, data recovery, and storage resource scheduling. It focuses on solving the problems of how to achieve orderly storage, rapid location, stable access, and security protection for different types of data after collection.

[0003] The shortcomings of existing technologies lie in the fact that general-purpose storage systems prioritize ordered storage, rapid location, stable access, and basic security. When dealing with data types like geopolymer hydroerosion data, which simultaneously contain formula information, operational information, and result information, and where these elements are closely related, they often employ a unified write, unified address, and unified read processing approach. This approach is prone to shortcomings in actual operation. For example, formula information and erosion results are often stored directly in corresponding record rows or data blocks. While retrieval is convenient, structural patterns, field patterns, and length patterns between adjacent records are easily exposed. If continuous reads occur in a concentrated manner, [the problem becomes more apparent]. By observing changes in storage location, the range of hot data can be inferred. For example, when records with similar water flow velocities are arranged consecutively in the same batch of tests, external comparison of adjacent block lengths or reading frequencies can gradually approach the critical test range. Meanwhile, existing technologies often concentrate security protection at the overall access control or static encryption level. Once confidentiality requirements are met, the ability to directly filter based on numerical ranges is often weakened. If a search needs to be conducted based on target flow velocity thresholds or target erosion depth thresholds, it easily becomes a matter of first decrypting a larger range of content and then comparing it line by line. This expands the reading range, lengthens the response chain, and simultaneously increases the exposure surface of the search process. Therefore, improvements are needed. Summary of the Invention

[0004] The purpose of this invention is to overcome the shortcomings of existing technologies and propose a secure encrypted storage method for geopolymer hydroerosion data.

[0005] To achieve the above objectives, the present invention employs the following technical solution: a secure encrypted storage method for geopolymer hydroerosion data, comprising the following steps:

[0006] Extract the aluminosilicate ratio, alkali activator concentration, dynamic water flow velocity, and geopolymer erosion depth to obtain ordered erosion ciphertext data. Perform character hash mapping transformation on the aluminosilicate ratio and alkali activator concentration to obtain mapping values. Based on the ordered erosion ciphertext data and mapping values, establish an erosion inverted index tree.

[0007] Based on the erosion inverted index tree, the data block capacity is extracted and the node level depth is calculated. The set of storage node coordinates is obtained. The corresponding aggregate erosion ciphertext blocks in the set of storage node coordinates are extracted. Pseudo-random character filling transformation and misalignment inversion transformation operations are performed on the aggregate erosion ciphertext blocks to generate a confused ciphertext storage structure.

[0008] Extract the target flow velocity threshold and target erosion depth threshold from the request conditions, extract the order-preserving erosion ciphertext data in each level node of the obfuscated ciphertext storage structure, filter and obtain the target erosion node set, extract the associated parent node and adjacent sibling node of the target erosion node set in the obfuscated ciphertext storage structure, and obtain the retrieval path data set.

[0009] The retrieval path data set is read and separated into obfuscated data blocks and real aggregate erosion ciphertext blocks to obtain the core erosion formula sequence; random displacement rearrangement transformation operation is performed on all data blocks in the retrieval path data set to generate a mask rearrangement data block array; and an obfuscated shuffling storage space is established based on the mask rearrangement data block array.

[0010] Preferably, the step of obtaining the eroded inverted index tree is as follows:

[0011] Extract the values ​​of aluminosilicate ratio, alkali activator concentration, dynamic water velocity and geopolymer erosion depth. Pair them one by one according to the same detection record number, check missing marks, duplicate marks and record sequence identifiers, retain the corresponding order of parameters, and form the original erosion parameter association sequence.

[0012] Based on the original erosion parameter association sequence, the dynamic water velocity value and the geopolymer erosion depth value are extracted in the recording order, written into the equidistant segmented position code and spliced ​​in the original corresponding order to obtain the order-preserving erosion ciphertext data. Then, the aluminosilicate ratio value and the alkali activator concentration value are extracted, and the mapping value is converted character by character. The first address pointer of the order-preserving erosion ciphertext data is written into the field corresponding to the mapping value to form a multi-branch tree node connection relationship.

[0013] Based on the multi-branch tree node connection relationship, the parent node identifier, child node identifier, hierarchical position identifier, and order-preserving eroded ciphertext data start address pointer corresponding to each mapping value are read in the storage array controller. The root node position, branch node position, and leaf node position are written in the order of the mapping values, and the node pointing order is registered to form an eroded inverted index tree.

[0014] Preferably, the step of obtaining the set of storage node coordinates is as follows:

[0015] Based on the erosion inverted index tree, read the node identifier, parent node identifier, child node identifier, and the pointer to the first address of the order-preserving erosion ciphertext data corresponding to each node. Locate the geopolymer erosion ciphertext block according to the pointer to the first address of the order-preserving erosion ciphertext data. Calculate the character length of each geopolymer erosion ciphertext block as the data block capacity. Register the node level depth according to the number of path layers from the root node to the current node. Then, map each node sequentially to the binary tree level node coordinate interval according to the node level depth. Record the level coordinates, interval number, and left and right branch positions of the node to form a storage node coordinate set.

[0016] Preferably, the step of obtaining the obfuscated ciphertext storage structure is as follows:

[0017] Based on the set of storage node coordinates, geopolymer erosion ciphertext blocks corresponding to hierarchical coordinates, interval numbers, and left and right branch positions are extracted one by one. Character segments are divided according to hierarchical coordinate order. The position for writing fill characters is determined according to the interval number. The number of fill characters to be written is determined according to the data block capacity. The inversion direction of the character segments is determined according to the left and right branch positions. For the geopolymer erosion ciphertext blocks that have completed the writing of fill characters, segment misalignment, reverse splicing, and tail-head transposition are performed to form a sector ciphertext sequence to be written.

[0018] The hierarchical coordinates, interval numbers, and left and right branch positions in the storage node coordinate set are called to generate a node coordinate sequence. The storage sector address, sector start offset position, and sector continuation offset position are allocated in sequence according to the node coordinate sequence. The ciphertext sequence to be written to the sector is written to the corresponding storage sector one by one. The node coordinate identifier, sector address identifier, and continuation association identifier corresponding to each ciphertext sequence to be written to the sector are registered to form an obfuscated ciphertext storage structure.

[0019] Preferably, the step of obtaining the target erosion node set is as follows:

[0020] Extract the target flow velocity threshold and target erosion depth threshold from the request conditions, read the order-preserving erosion ciphertext data corresponding to each level node in the obfuscated ciphertext storage structure layer by layer, split the flow velocity comparison field and erosion depth comparison field according to the preset field position, and perform size verification between the target flow velocity threshold and the flow velocity comparison field and the target erosion depth threshold and the erosion depth comparison field respectively. Register the flow velocity verification mark, erosion depth verification mark and node position identifier of each level node to form a threshold comparison node sequence;

[0021] Based on the threshold comparison node sequence, check the velocity verification mark and erosion depth verification mark one by one, filter out the hierarchical nodes whose velocity verification mark does not meet the target velocity threshold, filter out the hierarchical nodes whose erosion depth verification mark does not meet the target erosion depth threshold, retain the hierarchical nodes that simultaneously meet the target velocity threshold and the target erosion depth threshold, reorder according to the node position identifier and register the node association order to obtain the target erosion node set.

[0022] Preferably, the step of obtaining the retrieval path data set is as follows:

[0023] According to the node position identifier of each target erosion node set, the obfuscated ciphertext storage structure is looked back, and the corresponding associated parent node identifier, associated parent node content, adjacent sibling node identifier, and adjacent sibling node content are extracted. The associated parent node content is written into the preceding position in hierarchical order, the node content of the target erosion node set is written into the middle position, and the adjacent sibling node content is written into the following position in the node adjacency order, forming a retrieval path data set.

[0024] Preferably, the step of obtaining the core erosion formulation sequence is as follows:

[0025] The retrieval path data set is read sequentially in the storage array controller according to the registration order. The node identifier, block address identifier, character length identifier, and block type identifier in each record are checked in turn. According to the block type identifier, the retrieval path data set is split into obfuscated data blocks and real polymer erosion ciphertext blocks. Then, the characters of the real polymer erosion ciphertext blocks are reversed and restored block by block. The original arrangement order of the aluminosilicate ratio value, alkali activator concentration value, dynamic water flow velocity value, and geopolymer erosion depth value is extracted to form the core erosion formula sequence.

[0026] Preferably, the step of obtaining the shuffle storage space is as follows:

[0027] Call back the block address identifier corresponding to the core erosion formula sequence, locate all data blocks in the retrieval path data set, re-extract the complete character sequence of the obfuscated data block and the real polymer erosion ciphertext block according to the block address identifier, perform segmentation, intra-segment cyclic shift, inter-segment cross-transposition, and first and last segment rearrangement according to the arrangement position corresponding to the node identifier, register the new position identifier, original position identifier, and associated sector identifier of each data block after rearrangement, and generate a mask rearranged data block array;

[0028] Extract the associated sector identifier, original position identifier, and new position identifier corresponding to each data block in the mask rearranged data block array. Establish an overwrite order according to the new position identifier. Call the corresponding storage sector address in the obfuscated ciphertext storage structure one by one. Write the mask rearranged data block array to the corresponding storage sector address in the registration order to overwrite the original block content. Update the adjacent block link identifier, node pointing identifier, and sector continuation identifier to form an obfuscated shuffled storage space.

[0029] Compared with the prior art, the advantages and positive effects of the present invention are as follows:

[0030] In this invention, the dynamic water flow velocity and geopolymer erosion depth are converted into order-preserving erosion ciphertext data, allowing the retrieval of the basic size relationship to be maintained, avoiding the problems of difficult interval comparison and delayed threshold screening after conventional encryption. The aluminosilicate ratio and alkali activator concentration are converted into mapping values ​​and used to establish an erosion inverted index tree with the order-preserving erosion ciphertext data, ensuring a stable correspondence between formulation clues, erosion manifestations, and address pointers. This makes retrieval more focused, and subsequent calls do not require indiscriminate scanning of all content. The continuous introduction of data block capacity, node hierarchy depth, and storage node coordinate set transforms the ciphertext block writing from a sequential stacking state into an organizational form with hierarchical distribution characteristics, coordinate distribution characteristics, and inter-block discrete characteristics. By combining pseudo-random character filling transformation and misalignment inversion transformation operations, the risk of reverse engineering of ciphertext block length features, adjacent position features, and continuous content features can be simultaneously reduced. After the request conditions are entered, the target erosion node set is directly filtered around the target flow velocity threshold and the target erosion depth threshold, and then the parent node and adjacent sibling nodes are spliced ​​together to form a retrieval path data set, so that the retrieval behavior has a path camouflage effect. It is difficult for external observers to directly distinguish between the real hit trajectory and the accompanying trajectory. After reading, random displacement rearrangement transformation operation is performed on all data blocks and overwritten back to the storage area, so that the storage state continues to change after access. Historical access traces, fixed position exposure traces, and repeated call exposure traces are all compressed, thereby improving the confidentiality effect. Attached Figure Description

[0031] Figure 1 This is a schematic diagram of the steps of the present invention;

[0032] Figure 2 A diagram showing the mapping structure between the eroded inverted index tree and the order-preserving eroded ciphertext data;

[0033] Figure 3 A 3D scatter plot of data for thresholding the target erosion node set;

[0034] Figure 4 To obfuscate the distribution of physical address mappings before and after the storage space is rearranged. Detailed Implementation

[0035] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0036] Please see Figure 1-4 This invention provides a technical solution: a secure encrypted storage method for geopolymer hydroerosion data, comprising the following steps:

[0037] Extract the aluminosilicate ratio, alkali activator concentration, dynamic water flow velocity, and geopolymer erosion depth to obtain ordered erosion ciphertext data. Perform character hash mapping transformation on the aluminosilicate ratio and alkali activator concentration to obtain the mapping value. Based on the ordered erosion ciphertext data and the mapping value, establish an erosion inverted index tree.

[0038] Based on the erosion inverted index tree, extract the data block capacity and calculate the node level depth, obtain the storage node coordinate set, extract the aggregate erosion ciphertext block corresponding to the coordinate point in the storage node coordinate set, perform pseudo-random character filling transformation and misalignment inversion transformation operation on the aggregate erosion ciphertext block, and generate the obfuscated ciphertext storage structure.

[0039] Extract the target flow velocity threshold and target erosion depth threshold from the request conditions, extract the order-preserving erosion ciphertext data in each level of the obfuscated ciphertext storage structure, filter and obtain the target erosion node set, extract the associated parent node and adjacent sibling node of the target erosion node set in the obfuscated ciphertext storage structure, and obtain the retrieval path data set.

[0040] Read the retrieval path data set, separate it into obfuscated data blocks and real aggregate erosion ciphertext blocks, and obtain the core erosion formula sequence; perform random displacement rearrangement transformation operation on all data blocks in the retrieval path data set to generate a mask rearranged data block array, and establish an obfuscated shuffling storage space based on the mask rearranged data block array.

[0041] The steps to obtain the eroded inverted index tree are as follows:

[0042] Extract the values ​​of aluminosilicate ratio, alkali activator concentration, dynamic water velocity and geopolymer erosion depth. Pair them one by one according to the same detection record number, check missing marks, duplicate marks and record sequence identifiers, retain the corresponding order of parameters, and form the original erosion parameter association sequence.

[0043] Based on the original erosion parameter association sequence, the values ​​of dynamic water velocity and geopolymer erosion depth are extracted in the order of recording. They are written into equidistant segmented position codes and spliced ​​in the original corresponding order to obtain the sequence-preserving erosion ciphertext data. Then, the values ​​of aluminosilicate ratio and alkali activator concentration are extracted, and the mapping values ​​are converted character by character. The pointer of the first address of the sequence-preserving erosion ciphertext data is written into the field corresponding to the mapping value to form a multi-branch tree node connection relationship.

[0044] Based on the multi-way tree node connection relationship, the parent node identifier, child node identifier, hierarchical position identifier, and the pointer to the first address of the order-preserving eroded ciphertext data corresponding to each mapping value are read in the storage array controller. The root node position, branch node position, and leaf node position are written in the order of the mapping values, and the node pointing order is registered to form an eroded inverted index tree.

[0045] Specifically, after extracting the values ​​of aluminosilicate ratio, alkali activator concentration, dynamic water flow velocity, and geopolymer erosion depth, each record is paired according to the same detection record number. This involves iterating through all original data records, using the detection record number as a unique key, and grouping parameters with the same key (aluminosilicate ratio, alkali activator concentration, dynamic water flow velocity, and geopolymer erosion depth) into a preliminary parameter set. This set is then checked for completeness. For any parameter set, if any parameter value is empty or marked as invalid (e.g., -999), the entire parameter set is discarded. A repeatability check is then performed by comparing the detection record numbers of the parameter sets. If multiple... For parameter groups with the same number, only the parameter group with the latest timestamp is retained based on the timestamp field in the record, and all other duplicate parameter groups are deleted. Then, all retained parameter groups are sorted in ascending order according to the timestamp or the preset record order identifier to ensure that the processing order is consistent with the time sequence of data generation. This integrates the scattered measurements into a one-to-one corresponding valid parameter sequence arranged by time or experimental order. Finally, these parameter groups, which have been paired, verified, deduplicated, and sorted, are organized into a structured array according to their arrangement order. Each element contains five fields: detection record number, aluminosilicate ratio, alkali activator concentration, dynamic water flow velocity, and geopolymer erosion depth, forming the original erosion parameter association sequence.

[0046] Based on the original erosion parameter correlation sequence, the values ​​of dynamic water velocity and geopolymer erosion depth are extracted sequentially according to the recording order. These two values ​​are then encoded to generate order-preserving erosion encrypted data. This encoding process uses equidistant segmented position codes. Specifically, the range of dynamic water velocity is set to 0.00 to 99.99 m / s, and the range of geopolymer erosion depth is set to 0.00 to 999.99 mm. The dynamic water velocity value is multiplied by 100 and padded to a 4-digit string, for example, a velocity of 5.2 m / s is processed as "0520". The erosion depth value is multiplied by 100 and padded to a 5-digit string, for example, a depth of 12.34 mm is processed as "01234". Then, the two strings are concatenated in a fixed order of "flow rate-depth" to obtain a 9-bit string "052001234", which is a sequence-preserving erosion ciphertext data. This encoding method preserves the numerical order. Next, the aluminosilicate ratio and alkali activator concentration values ​​are extracted from the same record, and these two values ​​are transformed through a character-by-character hash mapping. This transformation is used to generate the index path of the subsequent tree structure. For example, for the aluminosilicate ratio "2.5" and the alkali activator concentration "10M", they are concatenated into the string "2.5_10M", and then the polynomial rolling hash function is applied to calculate its mapping value. The calculation formula is as follows: ,in, It is the concatenated string "2.5_10M". It is the first in the string The ASCII code value of each character. It is a prime number (e.g., 31). It is a large prime number to avoid hash collisions (e.g.) The hash result obtained by calculation This is the mapping value. Finally, this mapping value is associated with the storage starting address of the previously generated order-preserving eroded ciphertext data. Specifically, this is implemented in a hash table, using the mapping value... Using the key as the key and the memory address pointer of the ciphertext data "052001234" as the value, it is stored. After processing all records, a multi-branch tree node connection relationship is formed with the hash mapping value as the index and pointing to the specific eroded data.

[0047] Based on the multi-way tree node connections, a Trie tree (prefix tree) with character sequences of aluminosilicate ratios and alkali activator concentrations as paths is constructed as an erosion inverted index tree. The specific construction process is as follows: First, a root node is initialized in the storage array controller. This root node does not contain any characters, and its child nodes point to the first character of each ratio / concentration string. Then, all multi-way tree node connections generated in the previous step are traversed. For each connection, its ratio / concentration string (e.g., "2.5_10M") and the corresponding order-preserving erosion ciphertext data start address pointer are extracted. Starting from the root node of the Trie tree, the character path of the string "2.5_10M" is traversed downwards: "2" -> "." -> "5" -> "_" -> "1" -> "0" -> "M". During the traversal, if a child node corresponding to a certain character on the path does not exist, a new node is created. The system records the identifier of its parent node, its own node identifier, and its hierarchical position identifier (e.g., the root is level 0, "2" is level 1, "." is level 2, and so on). When the final leaf node (the node corresponding to the character "M") is reached along the complete string path, the pointer to the first address of the order-preserving erosion ciphertext data contained in the connection relationship is stored in a specific field of the leaf node. At the same time, a unique node identifier is assigned to each node in the tree (including the root node, branch nodes, and leaf nodes), and the identifier of its parent node and the identifier list of all child nodes are registered in its data structure to form a clear node pointing order. By repeating this insertion process for all the ratio concentration strings, a complete and structured Trie tree is finally constructed in memory. The path of the tree represents the erosion formula parameters, and the leaf nodes store pointers to the corresponding erosion result data, thus forming an erosion inverted index tree.

[0048] The steps to obtain the set of storage node coordinates are as follows:

[0049] Based on the erosion inverted index tree, read the node identifier, parent node identifier, child node identifier, and the pointer to the first address of the order-preserving erosion ciphertext data corresponding to each node. Locate the geopolymer erosion ciphertext block according to the pointer to the first address of the order-preserving erosion ciphertext data. Calculate the character length of each geopolymer erosion ciphertext block as the data block capacity. Register the node level depth according to the number of path layers from the root node to the current node. Then, map each node sequentially to the binary tree level node coordinate interval according to the node level depth. Record the level coordinates, interval number, and left and right branch positions of the node to form a storage node coordinate set.

[0050] Specifically, based on the erosion inverted index tree, each node is read layer by layer using a breadth-first traversal, obtaining the node identifier, parent node identifier, child node identifier, and the pointer to the first address of the order-preserving erosion ciphertext data. This pointer is used to locate and read the complete geopolymer erosion ciphertext block in memory. A character counting function is then called to count the number of characters in the ciphertext block, and this count is recorded as the data block capacity of that node. During the traversal, the root node's node level depth is recorded as 0, and the node level depth of all its child nodes is recorded as 1, and so on. The node level depth of any node is its parent node's depth plus 1. After depth registration, all nodes are grouped according to their node level depth. Within the same level, all nodes are sorted according to the order in which they were visited during the traversal. Then, these multi-way tree nodes are mapped to a virtual binary tree coordinate system. The specific mapping rule is as follows: for a node located at the... Layer (i.e., node hierarchy depth is) ), is the first in this layer The hierarchical coordinates of the visited nodes are... Its interval index is The positions of its left and right branches are determined by the parity of the interval index. If the number is even (including 0), the left and right branch positions are recorded as 0, representing the left branch. If the number is odd, the left and right branch positions are recorded as 1, representing the right branch. For example, if a node is in the 3rd layer and is the 5th node visited in that layer, its layer coordinates are 3, its interval number is 4, and its left and right branch positions are 0. The node identifier of each node is associated with and stored with the calculated layer coordinates, interval number, and left and right branch positions. Finally, the coordinate information of all nodes is collected to form a set of stored node coordinates.

[0051] The steps to obtain the obfuscated ciphertext storage structure are as follows:

[0052] Based on the set of storage node coordinates, extract the geopolymer erosion ciphertext blocks corresponding to the hierarchical coordinates, interval numbers, and left and right branch positions one by one. Divide the character segments according to the hierarchical coordinate order, determine the writing position of the fill characters according to the interval number, determine the number of fill characters to be written according to the data block capacity, and determine the inversion direction of the character segments according to the left and right branch positions. Continue to perform segment misalignment, reverse splicing, and tail-head transposition on the geopolymer erosion ciphertext blocks that have completed the filling character writing to form a sector ciphertext sequence to be written.

[0053] The hierarchical coordinates, interval numbers, and left and right branch positions in the storage node coordinate set are called to generate a node coordinate sequence. The storage sector address, sector start offset position, and sector continuation offset position are allocated in sequence according to the node coordinate sequence. The ciphertext sequence to be written to the sector is written to the corresponding storage sector one by one. The node coordinate identifier, sector address identifier, and continuation association identifier corresponding to each ciphertext sequence to be written to the sector are registered to form an obfuscated ciphertext storage structure.

[0054] Specifically, based on the set of stored node coordinates, the recorded node information is processed one by one. First, the hierarchical coordinates, interval number, left and right branch positions, and geopolymer-erased ciphertext blocks corresponding to each node are extracted. Then, a series of transformation operations are performed on the geopolymer-erased ciphertext blocks. The first step is character padding. The number of padding characters is calculated based on the data block capacity, specifically the sum of the data block capacity divided by 10 and the interval number modulo 5. The padding character is uniformly "#", and its writing position is determined by the interval number modulo 4. 0 represents insertion at the beginning of the ciphertext block, 1 represents insertion at the 1 / 4 position, 2 represents insertion at the 1 / 2 position, and 3 represents insertion at the end. The second step is segmentation and inversion, based on the node's hierarchical coordinates. The filled ciphertext block is divided into equal parts. If a character segment cannot be evenly divided, the last character segment contains all the remaining characters. Then, selective inversion is performed based on the values ​​of the left and right branch positions. If the left and right branch positions are 0, all even-numbered character segments (segments 0, 2, 4, ...) are reversed. If they are 1, all odd-numbered character segments (segments 1, 3, 5, ...) are reversed. The third step is obfuscation and rearrangement, which performs a segmented misalignment operation on the inverted character segment sequence, shifting the entire character segment sequence cyclically to the right by a number of positions equal to (the sum of the level coordinates and the interval index) modulo ( ). The result is obtained by reversing the misaligned character segment sequence and concatenating them in reverse order, that is, reconnecting them into a single string in the order from back to front. Finally, the first and last characters of the concatenated string are swapped. The above transformation is performed on all the geopolymer-overflowed ciphertext blocks of all nodes in the storage node coordinate set to generate a corresponding sector ciphertext sequence to be written.

[0055] The process involves retrieving the set of storage node coordinates, extracting the hierarchical coordinates and interval indices of all nodes, and sorting the node coordinates in ascending order based on the hierarchical coordinates as the primary key and the interval indices as the secondary key. This generates a deterministic and ordered sequence of node coordinates. Next, a storage base address is set, for example, 0x80000000, and the standard size of each storage sector is defined as 4096 bytes. Storage space is then allocated to each node according to the order of the node coordinate sequence. The ciphertext sequence to be written in the sector corresponding to each node will be allocated to the address (0x80000000 + ... A storage sector (4096 bytes) is allocated, with its starting offset at 0. The corresponding ciphertext sequence to be written is then written from the memory buffer to this allocated storage sector. During the write process, the length of the ciphertext sequence is checked. If its length is less than or equal to 4096 bytes, the continuation offset is set to 0, and the continuation association flag is set to an invalid value (e.g., 0x00000000), indicating that the data block occupies only one sector. If its length exceeds 4096 bytes, the first 4096 bytes are written to the current sector, and the next contiguous storage sector (address 0x80000000 + ()) is immediately allocated. (+1) × 4096), set the continuation association flag of the current sector to the address of the new sector, write the remaining data to the new sector, and simultaneously allocate the data originally planned to the first sector. The positions of +1 nodes are extended sequentially. Finally, a metadata record is created for each sector to be written to the storage. This record contains the original node coordinates, the actual sector address, and the continuation association for handling cross-sector cases. All these metadata records are put together to form the final obfuscated ciphertext storage structure.

[0056] The steps for obtaining the target erosion node set are as follows:

[0057] Extract the target flow velocity threshold and target erosion depth threshold from the request conditions, read the order-preserving erosion ciphertext data corresponding to each level node in the obfuscated ciphertext storage structure layer by layer, split the flow velocity comparison field and erosion depth comparison field according to the preset field position, and perform size verification between the target flow velocity threshold and the flow velocity comparison field and the target erosion depth threshold and the erosion depth comparison field respectively. Register the flow velocity verification mark, erosion depth verification mark and node position identifier of each level node to form a threshold comparison node sequence;

[0058] Based on the threshold comparison node sequence, check the velocity verification mark and erosion depth verification mark one by one, filter out the hierarchical nodes whose velocity verification mark does not meet the target velocity threshold, filter out the hierarchical nodes whose erosion depth verification mark does not meet the target erosion depth threshold, retain the hierarchical nodes that meet both the target velocity threshold and the target erosion depth threshold, reorder according to the node position identifier and register the node association order to obtain the target erosion node set.

[0059] Specifically, the target flow velocity threshold and target erosion depth threshold specified in the request conditions are extracted. For example, the target flow velocity threshold is "greater than or equal to 10 m / s" and the target erosion depth threshold is "less than 50 mm". Then, the obfuscated ciphertext storage structure is traversed, and all level nodes are read one by one according to the hierarchical order. For each node, its content first needs to be reverse-transformed to restore the original order-preserving erosion ciphertext data. Since the obfuscation process involves pseudo-random character padding, misalignment, segment misalignment, reverse concatenation, and end-to-end swapping, the reverse process needs to precisely execute the reverse steps of these operations. After restoring the order-preserving erosion ciphertext data, for example, the string "150004500", it is split into the flow velocity comparison field "1500" and the erosion depth comparison field "04500" according to the preset field position rules (the first 4 characters are the flow velocity, and the last 5 characters are the depth). These two strings are then converted into numerical values. The flow rate is 15.00 m / s and the erosion depth is 45.00 mm. Then, a size check is performed. The flow rate of 15.00 m / s is compared with the target flow rate threshold of 10 m / s. Since 15.00 is greater than or equal to 10, the flow rate check mark is set to 1 (satisfied). The erosion depth of 45.00 mm is compared with the target erosion depth threshold of 50 mm. Since 45.00 is less than 50, the erosion depth check mark is also set to 1 (satisfied). If the flow rate is 8.00 m / s, the flow rate check mark is set to 0 (not satisfied). If the erosion depth is 60.00 mm, the erosion depth check mark is also set to 0 (not satisfied). The flow rate check mark, erosion depth check mark, and unique node position identifier (e.g., sector address and offset combination) of each node in the obfuscated ciphertext storage structure are recorded together. After traversing all nodes, a threshold comparison node sequence containing the comparison results of all nodes is formed.

[0060] Based on the threshold comparison node sequence, each node is processed to filter out nodes that meet all conditions. First, the entire sequence is traversed, checking the velocity verification flag of each node. If the velocity verification flag of a node is 0, it means that the corresponding dynamic water velocity does not meet the target velocity threshold set in the request conditions. For example, if the request requires a velocity greater than 10 m / s, but the velocity of this node is 8 m / s, then this node is removed from the sequence and not proceeded to further processing. Next, the set of nodes retained after the first round of filtering is traversed again, checking the erosion depth verification flag of each node. If the erosion depth verification flag of a node is 0, it means that the corresponding erosion depth does not meet the target erosion depth threshold set in the request conditions. For example, if the request requires a erosion depth greater than 10 m / s, but the velocity of this node is 8 m / s, then this node is removed from the sequence and not proceeded to further processing. If the depth is less than 50mm but the node depth is 60mm, this node is also filtered out. After these two rounds of continuous filtering operations, only those level nodes with both flow velocity verification mark and erosion depth verification mark of 1 are retained in the sequence. These nodes represent that their erosion data simultaneously meet the dual query conditions of flow velocity and depth. Finally, the node position identifiers of these retained nodes are extracted and reordered according to the physical storage order or logical hierarchical order of these identifiers in the original obfuscated ciphertext storage structure, such as sorting by sector address from smallest to largest. At the same time, the association order of adjacent nodes is registered for the sorted node sequence, forming an ordered set containing all nodes that meet the query conditions, i.e., the target erosion node set.

[0061] The steps to obtain the retrieval path data set are as follows:

[0062] According to the node position identifier of each target erosion node set, the obfuscated encrypted storage structure is back-looked up, and the corresponding related parent node identifier, related parent node content, adjacent sibling node identifier, and adjacent sibling node content are extracted. The related parent node content is written into the first position in hierarchical order, the node content of the target erosion node set is written into the middle position, and the adjacent sibling node content is written into the last position in the node adjacency order, forming a retrieval path data set.

[0063] Specifically, following the order of the node location identifiers in the target erosion node set, the obfuscated ciphertext storage structure is queried back one by one. For each node in the target erosion node set, its specific location in the obfuscated ciphertext storage structure is located using its node location identifier, and the content of that node is read. Simultaneously, using the parent-child node relationships recorded when constructing the erosion inverted index tree, the identifier of the associated parent node of that node is found and extracted. Then, its content is located and read using this parent node identifier, i.e., the content of the associated parent node. Next, other child nodes that have the same parent node as the current target node are found; these are the adjacent sibling nodes. The identifiers and contents of all adjacent sibling nodes are extracted. For example, if a target node is a leaf node of the Trie tree path "2->.->5", its parent node is "2-> If the node with the '.' symbol has a sibling node that is "2->.->6", then extract the content of the "2->." node as the parent node content and the content of the "2->.->6" node as the sibling node content. Then, create a new data structure, placing the extracted related parent node content at the beginning, followed by the node content of the currently processed target erosion node set in the middle. Finally, append all the extracted adjacent sibling node content to the end according to their original adjacency order (e.g., the order of arrangement at the same level in the Trie tree), forming a data block composed of the three parts of "parent-child (target)-sibling". Repeat this operation for all nodes in the target erosion node set, and gather all the generated data blocks to form the final retrieval path data set.

[0064] The steps to obtain the core erosion formula sequence are as follows:

[0065] The retrieval path data set is read one by one in the registration order within the storage array controller. The node identifier, block address identifier, character length identifier, and block type identifier in each record are checked in turn. According to the block type identifier, the retrieval path data set is split into obfuscated data blocks and real polymer erosion ciphertext blocks. Then, the characters of the real polymer erosion ciphertext blocks are reversed and restored block by block. The original arrangement order of the aluminosilicate ratio value, alkali activator concentration value, dynamic water flow velocity value, and geopolymer erosion depth value is extracted to form the core erosion formula sequence.

[0066] Specifically, the retrieval path data set is read line by line in the storage array controller according to the registration order. For each record, its block type identifier is checked first. This identifier is a preset integer field. For example, 1 represents a real polymer erosion ciphertext block, and 0 represents a confused data block as interference. Based on this identifier, all data blocks in the retrieval path data set are classified into two independent sets: the confused data block set and the real polymer erosion ciphertext block set. Next, a reverse character inversion restoration operation is performed on each data block in the real polymer erosion ciphertext block set. This operation is the reverse process of the transformation performed when generating the sector ciphertext sequence to be written. Specifically, it includes first performing a first-end swap, exchanging the first and last characters of the data block, and then performing a reverse misaligned splicing, treating the current data block as a character segment sequence, and calculating the cyclic translation at that time according to the hierarchical coordinates and interval sequence number recorded at the time of generation. The number of bits is determined by performing a reverse cyclic shift, and then a character reversal operation is performed on the specified character segment (determined by the left and right branch positions to cancel the previous inversion). Finally, the previously filled pseudo-random characters are removed to restore the original order-preserving erosion ciphertext data. From the restored order-preserving erosion ciphertext data, the dynamic water flow velocity value and the geopolymer erosion depth value are parsed according to the rule that the first 4 bits represent the flow velocity and the last 5 bits represent the depth. At the same time, the erosion inverted index tree is traced back according to the node identifier of the data block to obtain its complete path information. This path represents the aluminosilicate ratio value and the alkali activator concentration value. These four parameters are combined according to their original correlation to form a complete formula record. This process is repeated for all real geopolymer erosion ciphertext blocks. Finally, all the parsed formula records are arranged in their original order in the retrieval path data set to form the core erosion formula sequence.

[0067] The steps to obtain the storage space for the obfuscated shuffle are as follows:

[0068] The callback identifies the block address corresponding to the core erosion recipe sequence, locates all data blocks in the retrieval path data set, re-extracts the complete character sequence of the obfuscated data block and the real polymer erosion ciphertext block according to the block address identifier, performs segmentation, intra-segment cyclic shifting, inter-segment cross-transposition, and first and last segment rearrangement according to the arrangement position corresponding to the node identifier, registers the new position identifier, original position identifier, and associated sector identifier of each data block after rearrangement, and generates a mask rearranged data block array.

[0069] Extract the associated sector identifier, original position identifier, and new position identifier corresponding to each data block in the masked rearranged data block array. Establish the overwrite order according to the new position identifier, call the corresponding storage sector address in the obfuscated ciphertext storage structure one by one, and write the masked rearranged data block array to the corresponding storage sector address in the registration order to overwrite the original block content. Update the adjacent block link identifier, node pointing identifier, and sector continuation identifier to form an obfuscated shuffled storage space.

[0070] Specifically, the block address identifier attached to each record in the callback core erosion recipe sequence is used to locate and re-extract all relevant data blocks in the original storage location of the retrieval path data set, including obfuscated data blocks and real polymer erosion ciphertext blocks, forming a pool of data blocks to be processed. For each data block in the pool, its unique node identifier is used to query its ranking in the target erosion node set (e.g., the first matching node has a ranking of 0, the second has a ranking of 1, and so on). Then, based on this ranking and the attributes of the data block itself, a series of rearrangement transformations are performed. First, segmentation is performed, dividing the complete character sequence of the data block into N equal-length segments. The number of segments N is calculated as N = (data block character length mod 8) + 5. If the segments cannot be evenly divided, the last segment contains all remaining characters. Next, intra-segment circular shift is performed, shifting the characters in each segment to the right by a number of bits equal to (rank + segment number) modulo 8. The process involves four steps: first, segment length; second, inter-segment cross-swapping, where the contents of the i-th segment are swapped with those of the (N-1)-i-th segment; third, first and last segment rearrangement, where the contents of the first and last segments after cross-swapping are swapped again. After these four steps, each data block generates a new obfuscated version. Each transformed data block is registered with its new position identifier (based on a new random permutation or hash value), its original permutation position identifier, and its associated sector identifier in physical storage. All transformed data blocks and their newly registered metadata are then aggregated to generate a masked rearranged data block array.

[0071] The metadata of all data blocks in the masked rearrangement data block array is extracted, namely the associated sector identifier, original position identifier, and new position identifier. The entire array is sorted in ascending order based on the new position identifier to establish a deterministic overwrite order. Then, data blocks are processed one by one in this order. For the data block being processed, its associated sector identifier is read first. This identifier points to its original storage sector address in the obfuscated ciphertext storage structure. Then, a storage write instruction is invoked to completely write the current data block (which has already undergone masked rearrangement transformation) to that sector address. This operation directly overwrites the original old data block content in the sector. After the write is completed, the metadata structure of the storage space is updated, specifically including updating the adjacent block link identifier, finding the data block whose original position identifier is incremented by 1, and obtaining its new associated sector identifier. Then, the "next block" pointer of the current block is pointed to this address to maintain logical continuity. Next, the node pointer identifier is updated. If the pointer information of the leaf nodes of the Trie tree is directly or indirectly stored in the sector metadata, these pointers are updated as needed to reflect the state that the content has been "shuffled". Finally, the length of the newly written data block is checked. If its length exceeds the capacity of a sector (e.g., 4096 bytes), subsequent sectors need to be allocated for it, and the sector continuation identifier in the metadata of the current sector is updated to point to the address of the next sector. If the length is less than the sector capacity, the continuation identifier is cleared to zero. This overwrite and update process is repeated for all data blocks in the mask rearranged data block array until all are processed. The original obfuscated ciphertext storage structure is then transformed into a new obfuscated shuffled storage space.

[0072] The above are merely preferred embodiments of the present invention and are not intended to limit the present invention in any other way. Any person skilled in the art may make changes or modifications to the above-disclosed technical content to create equivalent embodiments that can be applied to other fields. However, any simple modifications, equivalent changes, and modifications made to the above embodiments based on the technical essence of the present invention without departing from the scope of the present invention shall still fall within the protection scope of the present invention.

Claims

1. A method for secure encryption of data of geopolymer hydrodynamic erosion, characterized in that, Includes the following steps: Extract the aluminosilicate ratio, alkali activator concentration, dynamic water flow velocity, and geopolymer erosion depth to obtain ordered erosion ciphertext data. Perform character hash mapping transformation on the aluminosilicate ratio and alkali activator concentration to obtain mapping values. Based on the ordered erosion ciphertext data and mapping values, establish an erosion inverted index tree. Based on the erosion inverted index tree, the data block capacity is extracted and the node level depth is calculated. The set of storage node coordinates is obtained. The corresponding aggregate erosion ciphertext blocks in the set of storage node coordinates are extracted. Pseudo-random character filling transformation and misalignment inversion transformation operations are performed on the aggregate erosion ciphertext blocks to generate a confused ciphertext storage structure. Extract the target flow velocity threshold and target erosion depth threshold from the request conditions, extract the order-preserving erosion ciphertext data in each level node of the obfuscated ciphertext storage structure, filter and obtain the target erosion node set, extract the associated parent node and adjacent sibling node of the target erosion node set in the obfuscated ciphertext storage structure, and obtain the retrieval path data set. Read the data set of the retrieval path, separate it into obfuscated data blocks and real polymer erosion ciphertext blocks, and obtain the core erosion formula sequence; A random displacement rearrangement transformation operation is performed on all data blocks within the retrieval path data set to generate a mask rearrangement data block array. Based on the mask rearrangement data block array, a shuffling and confusion storage space is established.

2. The method for secure encryption storage of geopolymer hydrodynamic erosion data according to claim 1, characterized in that, The steps for obtaining the eroded inverted index tree are as follows: Extract the values ​​of aluminosilicate ratio, alkali activator concentration, dynamic water velocity and geopolymer erosion depth. Pair them one by one according to the same detection record number, check missing marks, duplicate marks and record sequence identifiers, retain the corresponding order of parameters, and form the original erosion parameter association sequence. Based on the original erosion parameter association sequence, the dynamic water velocity value and the geopolymer erosion depth value are extracted in the recording order, written into the equidistant segmented position code and spliced ​​in the original corresponding order to obtain the order-preserving erosion ciphertext data. Then, the aluminosilicate ratio value and the alkali activator concentration value are extracted, and the mapping value is converted character by character. The first address pointer of the order-preserving erosion ciphertext data is written into the field corresponding to the mapping value to form a multi-branch tree node connection relationship. Based on the multi-branch tree node connection relationship, the parent node identifier, child node identifier, hierarchical position identifier, and order-preserving eroded ciphertext data start address pointer corresponding to each mapping value are read in the storage array controller. The root node position, branch node position, and leaf node position are written in the order of the mapping values, and the node pointing order is registered to form an eroded inverted index tree.

3. The method for secure encryption storage of geopolymer hydrodynamic erosion data according to claim 1, wherein, The steps for obtaining the set of storage node coordinates are as follows: Based on the erosion inverted index tree, read the node identifier, parent node identifier, child node identifier, and the pointer to the first address of the order-preserving erosion ciphertext data corresponding to each node. Locate the geopolymer erosion ciphertext block according to the pointer to the first address of the order-preserving erosion ciphertext data. Calculate the character length of each geopolymer erosion ciphertext block as the data block capacity. Register the node level depth according to the number of path layers from the root node to the current node. Then, map each node sequentially to the binary tree level node coordinate interval according to the node level depth. Record the level coordinates, interval number, and left and right branch positions of the node to form a storage node coordinate set.

4. The method for secure encryption storage of geopolymer hydrodynamic erosion data according to claim 1, wherein, The steps for obtaining the obfuscated ciphertext storage structure are as follows: Based on the set of storage node coordinates, geopolymer erosion ciphertext blocks corresponding to hierarchical coordinates, interval numbers, and left and right branch positions are extracted one by one. Character segments are divided according to hierarchical coordinate order. The position for writing fill characters is determined according to the interval number. The number of fill characters to be written is determined according to the data block capacity. The inversion direction of the character segments is determined according to the left and right branch positions. For the geopolymer erosion ciphertext blocks that have completed the writing of fill characters, segment misalignment, reverse splicing, and tail-head transposition are performed to form a sector ciphertext sequence to be written. The hierarchical coordinates, interval numbers, and left and right branch positions in the storage node coordinate set are called to generate a node coordinate sequence. The storage sector address, sector start offset position, and sector continuation offset position are allocated in sequence according to the node coordinate sequence. The ciphertext sequence to be written to the sector is written to the corresponding storage sector one by one. The node coordinate identifier, sector address identifier, and continuation association identifier corresponding to each ciphertext sequence to be written to the sector are registered to form an obfuscated ciphertext storage structure.

5. The method for secure encryption storage of geopolymer hydrodynamic erosion data according to claim 1, wherein, The steps for obtaining the target erosion node set are as follows: Extract the target flow velocity threshold and target erosion depth threshold from the request conditions, read the order-preserving erosion ciphertext data corresponding to each level node in the obfuscated ciphertext storage structure layer by layer, split the flow velocity comparison field and erosion depth comparison field according to the preset field position, and perform size verification between the target flow velocity threshold and the flow velocity comparison field and the target erosion depth threshold and the erosion depth comparison field respectively. Register the flow velocity verification mark, erosion depth verification mark and node position identifier of each level node to form a threshold comparison node sequence; Based on the threshold comparison node sequence, check the velocity verification mark and erosion depth verification mark one by one, filter out the hierarchical nodes whose velocity verification mark does not meet the target velocity threshold, filter out the hierarchical nodes whose erosion depth verification mark does not meet the target erosion depth threshold, retain the hierarchical nodes that simultaneously meet the target velocity threshold and the target erosion depth threshold, reorder according to the node position identifier and register the node association order to obtain the target erosion node set.

6. The method for secure encryption of geopolymer hydrodynamic erosion data according to claim 1, wherein, The steps for obtaining the retrieval path data set are as follows: According to the node position identifier of each target erosion node set, the obfuscated ciphertext storage structure is looked back, and the corresponding associated parent node identifier, associated parent node content, adjacent sibling node identifier, and adjacent sibling node content are extracted. The associated parent node content is written into the preceding position in hierarchical order, the node content of the target erosion node set is written into the middle position, and the adjacent sibling node content is written into the following position in the node adjacency order, forming a retrieval path data set.

7. The method for secure encryption of geopolymer hydrodynamic erosion data according to claim 1, wherein, The steps for obtaining the core erosion formula sequence are as follows: The retrieval path data set is read sequentially in the storage array controller according to the registration order. The node identifier, block address identifier, character length identifier, and block type identifier in each record are checked in turn. According to the block type identifier, the retrieval path data set is split into obfuscated data blocks and real polymer erosion ciphertext blocks. Then, the characters of the real polymer erosion ciphertext blocks are reversed and restored block by block. The original arrangement order of the aluminosilicate ratio value, alkali activator concentration value, dynamic water flow velocity value, and geopolymer erosion depth value is extracted to form the core erosion formula sequence.

8. The method for secure encryption of geopolymer hydrodynamic erosion data according to claim 1, wherein, The steps for obtaining the shuffling storage space are as follows: Call back the block address identifier corresponding to the core erosion formula sequence, locate all data blocks in the retrieval path data set, re-extract the complete character sequence of the obfuscated data block and the real polymer erosion ciphertext block according to the block address identifier, perform segmentation, intra-segment cyclic shift, inter-segment cross-transposition, and first and last segment rearrangement according to the arrangement position corresponding to the node identifier, register the new position identifier, original position identifier, and associated sector identifier of each data block after rearrangement, and generate a mask rearranged data block array; Extract the associated sector identifier, original position identifier, and new position identifier corresponding to each data block in the mask rearranged data block array. Establish an overwrite order according to the new position identifier. Call the corresponding storage sector address in the obfuscated ciphertext storage structure one by one. Write the mask rearranged data block array to the corresponding storage sector address in the registration order to overwrite the original block content. Update the adjacent block link identifier, node pointing identifier, and sector continuation identifier to form an obfuscated shuffled storage space.

Images