Dynamic secure storage method, system and device of big data platform and medium

Abstract

The invention discloses a dynamic security storage method, system and device of a big data platform and a medium, and relates to the technical field of data security storage, and the method comprises the following steps: generating a platform encryption key for the big data platform; distributing a distributed storage node for the platform data, performing encryption calculation on the platform data based on the platform encryption key to obtain encrypted data, and converting the encrypted data into dynamic data; performing secure storage on the dynamic data; the method and the device are used for solving the problem that the security of stored data is insufficient due to the fact that the protection means is too single in the existing data security storage technology.

Description

Technical Field

[0001] The present invention relates to the technical field of data secure storage, and particularly to a dynamic secure storage method, system, device and medium for a big data platform. Background Art

[0002] Data secure storage technology refers to a series of technical means and management measures to ensure that data meets the core objectives of confidentiality, integrity and availability during storage (including local, cloud or other media), while resisting unauthorized access, tampering, leakage or damage.

[0003] Existing data secure storage technologies usually encrypt and store data, but the security guarantee for encrypted storage is insufficient, and the encrypted ciphertext is extremely easy to leak. At the same time, the encryption process is too simple, and the protection means for data security are too single, and there is still a possibility of being cracked. For example, in the patent application with the publication number CN115270188A, a data secure storage and processing method and system are disclosed. This solution only ensures the secure storage of data through sequential data encryption. The protection means for data security are too single, and the security of the protection means is insufficient. Existing data secure storage technologies also have the problem that the protection means are too single, resulting in insufficient security of stored data. Summary of the Invention

[0004] The present invention aims to solve at least one of the technical problems in the prior art to some extent. By generating a platform encryption key for the big data platform, setting up distributed storage nodes, distributing platform data to different distributed storage nodes, then performing encryption calculation on the platform data based on the platform encryption key to obtain encrypted data, setting up dynamic conversion rules to convert the encrypted data into dynamic data, and finally securely storing the dynamic data, to solve the problem that existing data secure storage technologies still have the problem that the protection means are too single, resulting in insufficient security of stored data.

[0005] To achieve the above object, in the first aspect, the present application provides a dynamic secure storage method for a big data platform, including the following steps:

[0006] Generate a platform encryption key for the big data platform;

[0007] Allocate distributed storage nodes for platform data and perform encryption calculation on the platform data based on the platform encryption key to obtain encrypted data, and then convert it into dynamic data;

[0008] Securely store the dynamic data.

[0009] Further, generating a platform encryption key for the big data platform includes the following sub-steps:

[0010] The administrator sets the management key;

[0011] Calculate the hash value of the management key, convert the calculated hexadecimal hash value to decimal and mark it as the platform encryption key;

[0012] The platform encryption key is not stored in the big data platform. It is only directly used after being converted from the management key to the platform encryption key during encryption calculation and is not stored in the form of data.

[0013] Further, allocate distributed storage nodes for platform data and perform encryption calculation on the platform data based on the platform encryption key to obtain encrypted data, and then convert it into dynamic data, including the following sub-steps:

[0014] Set distributed storage nodes and allocate platform data to different distributed storage nodes;

[0015] Perform encryption calculation on the platform data based on the platform encryption key to obtain encrypted data;

[0016] Set dynamic conversion rules to convert the encrypted data into dynamic data.

[0017] Further, setting distributed storage nodes and allocating platform data to different distributed storage nodes includes the following sub-steps:

[0018] Obtain platform data, convert the platform data into hexadecimal Unicode encoding, and at the same time remove the prefix "\u" to obtain the first-phase encoding;

[0019] Obtain the corresponding Unicode encoding after conversion for each character in the order from left to right of the first-phase encoding, and mark it as E n , where n is a non-zero natural number and n is the serial number of E;

[0020] Obtain E n The maximum value of, mark it as max(E), set a storage loop, the storage loop is a virtual circle, evenly set max(E) data nodes on the storage loop, number the data nodes, and use the symbol S i To represent, where i is a non-zero natural number and i is the serial number of S, with i of the data node directly above the storage loop being 1, increasing in sequence along the clockwise direction, 1 ≤ i ≤ max(E);

[0021] Set the first node number of distributed storage nodes on the storage loop. The distributed storage nodes are evenly distributed on the storage loop and coincide with one of the data nodes. Mark the S corresponding to the distributed storage node i As T i According to T iNumber the distributed storage nodes in ascending order of the serial number i, and use the symbol P j to represent, where j is a non-zero natural number and j is the serial number of P, and the maximum value of j is the number of the first node;

[0022] Search for E n corresponding data node S i , mark it as R n , and assign E n to the closest P n for storage. j

[0023] Furthermore, perform encryption calculation on the platform data based on the platform encryption key, and the obtained encrypted data includes the following sub-steps:

[0024] For any E n , add "n / " before the original Unicode encoding, excluding the quotation marks, and mark the modified E n as F n ;

[0025] For any F n , number the characters in F n in order from left to right, and use the symbol H m to represent, where m is a non-zero natural number and m is the serial number of H, and convert H m to decimal ASCII encoding and mark it as G m ;

[0026] Obtain the maximum value of m, mark it as max(m), construct a matrix of max(m)×max(m), name it the encoding matrix, number each data cell in the encoding matrix, and use the symbol K(a,b) to represent, where a and b are both non-zero natural numbers and (a,b) is the serial number of K, 1≤a≤max(m), 1≤b≤max(m), and fill G m into K(m,m), and set the rest of K(a,b) to 0;

[0027] Obtain the platform encryption key, number the characters in the platform encryption key in order from left to right, and use the symbol D c to represent, where c is a non-zero natural number and c is the serial number of D, construct another encoding matrix, name it the key matrix, number each data cell in the key matrix, and use the symbol L(a,b) to represent, fill D c into L(c,c), and set the rest of L(a,b) to 0;

[0028] ​Multiply the encoding matrix by the key matrix to obtain a calculation matrix. Number the data cells in the calculation matrix, denoted by the symbol U(a,b). Obtain the minimum and maximum values in U(a,b), denoted as min(U) and max(U) respectively. Randomly assign values to U(a,b) where a≠b, and the range of the assigned values is from min(U) to max(U);

[0029] The finally obtained U(a,b) is the encrypted data.

[0030] Further, set dynamic conversion rules to convert the encrypted data into dynamic data, including the following sub-steps:

[0031] Set dynamic delimiter symbols, which include dynamic same-part delimiter symbols and dynamic different-part delimiter symbols. The format of the dynamic same-part delimiter symbol is QYQ, and the format of the dynamic different-part delimiter symbol is QyQ, where Q represents any digit from 0 to 9, Y represents any capital letter, and y represents any lowercase letter. Both the dynamic same-part delimiter symbol and the dynamic different-part delimiter symbol will change in real time;

[0032] Number U(a,b) in the order from the upper left to the lower right, first from left to right and then from top to bottom, denoted by the symbol W v where v is a non-zero natural number and v is the serial number of W. For any W v , number the characters in W v in the order from left to right, denoted by the symbol WG h where h is a non-zero natural number and h is the serial number of WG;

[0033] Add a dynamic different-part delimiter symbol between every two adjacent Ws v , and add a dynamic same-part delimiter symbol between every two adjacent WGs h ;

[0034] For any WG h , convert WG h into a dynamic number with the first dynamic number of digits. Mark the last digit in the dynamic number as the decision number, and mark the remaining digits as transformation numbers;

[0035] Add up the transformation numbers to calculate the total sum, obtaining the transformation addend. Add the transformation addend to the decision number, and mark the final calculation result as the judgment addend;

[0036] The transformation numbers can change in real time. The decision number changes in real time based on the change of the transformation numbers. When the decision number changes, it is necessary to ensure that the units digit of the judgment addend is the same as that of WG h ;

[0037] For each W v inside, for each WGh Change them all to dynamic numbers while keeping the dynamic delimiter unchanged. The resulting string is the dynamic data.

[0038] Furthermore, the secure storage of dynamic data includes the following sub-steps:

[0039] Store the dynamic data in the corresponding distributed storage nodes;

[0040] When reading the platform data, it is only necessary to reverse-execute the analysis process of the dynamic data and the encrypted data. After decryption, restore based on the sequence of F n The previous n pairs of E n to obtain the first-stage encoding, and then restore the first-stage encoding to Chinese to obtain the platform data.

[0041] In a second aspect, the present application provides a dynamic secure storage system for a big data platform, including a key generation module, a dynamic encryption module, and a secure storage module; the key generation module and the secure storage module are respectively connected to the dynamic encryption module for data connection;

[0042] The key generation module is used to generate a platform encryption key for the big data platform;

[0043] The dynamic encryption module is used to allocate distributed storage nodes for the platform data and perform encryption calculations on the platform data based on the platform encryption key to obtain encrypted data, and then convert it into dynamic data;

[0044] The secure storage module is used to securely store the dynamic data.

[0045] In a third aspect, the present application provides an electronic device, including a processor and a memory, where the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the steps in the above method are run.

[0046] In a fourth aspect, the present application provides a storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps in the above method are run.

[0047] Advantages of the present invention: The present invention generates a platform encryption key for the big data platform and simultaneously sets up distributed storage nodes to distribute the platform data to different distributed storage nodes. The advantage lies in that when distributing the distributed storage nodes, it is distributed based on the storage loop and the Unicode encoding after the conversion of the platform data, and the distribution is carried out in units of each character. After the distribution, the data stored in different distributed storage nodes is relatively messy, which can effectively prevent others from obtaining the complete stored data and improve the security and effectiveness of the secure storage of data;

[0048] The present invention encrypts and calculates platform data based on a platform encryption key to obtain encrypted data, then sets a dynamic conversion rule to convert the encrypted data into dynamic data, and finally securely stores the dynamic data. The advantage is that the ciphertext of conventional encrypted storage is usually a fixed value, while the present invention finally converts the ciphertext into dynamic data, enabling it to be changed in real time, greatly increasing the cracking difficulty, and further improving the security and effectiveness of data secure storage. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] Figure 1 is a schematic block diagram of the system of the present invention;

[0050] Figure 2 is a schematic diagram of the storage loop of the present invention;

[0051] Figure 3 is a flowchart of the steps of the method of the present invention;

[0052] Figure 4 is a schematic structural diagram of the electronic device of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0053] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0054] Embodiment 1, please refer to Figure 1 as shown, the present application provides a dynamic secure storage system for a big data platform, including a key generation module, a dynamic encryption module, and a secure storage module; the key generation module and the secure storage module are respectively connected to the dynamic encryption module for data connection;

[0055] The key generation module is used to generate a platform encryption key for the big data platform;

[0056] The key generation module is configured with a key generation strategy, and the key generation strategy includes:

[0057] The administrator sets the management key;

[0058] Calculate the hash value of the management key, convert the calculated hexadecimal hash value to decimal and mark it as the platform encryption key;

[0059] The platform encryption key is not stored in the big data platform and is only directly used after being converted from the management key to the platform encryption key during encryption calculation, without being stored in the form of data;

[0060] In practical applications, the management key is the key built into the big data platform. The management key in this embodiment is set to "SecretKey" and calculated using the MD2 hash algorithm. The obtained hexadecimal hash value is "a36319714798f85559a5fa3279a94750", and when converted to decimal, the platform encryption key is "217178716737117055765393582500606461776".

[0061] The dynamic encryption module is used to allocate distributed storage nodes for platform data and perform encryption calculations on the platform data based on the platform encryption key to obtain encrypted data, and then convert it into dynamic data. The dynamic encryption module includes a distributed allocation unit, an encryption calculation unit, and a dynamic conversion unit.

[0062] The distributed allocation unit is used to set distributed storage nodes and allocate platform data to different distributed storage nodes.

[0063] The distributed allocation unit is configured with a distributed allocation strategy, and the distributed allocation strategy includes:

[0064] Obtain the platform data, convert the platform data into hexadecimal Unicode encoding, and at the same time remove the prefix "" therein to obtain the first-stage encoding.

[0065] Obtain the corresponding Unicode encoding after conversion of each character in the order from left to right of the first-stage encoding, and mark it as E n , where n is a non-zero natural number and n is the serial number of E;

[0066] Please refer to Figure 2 as shown, obtain the maximum value of E n and mark it as max(E). Set a storage loop. The storage loop is a virtual circle. Uniformly set max(E) data nodes on the storage loop, number the data nodes, and represent them by the symbol S i , where i is a non-zero natural number and i is the serial number of S. Take i of the data node directly above the storage loop as 1, and increase sequentially in the clockwise direction, 1 ≤ i ≤ max(E);

[0067] In practical applications, in this embodiment, it is assumed that the platform data is "financing 100,000 yuan", and the converted first-phase code is "878d8d44003100304e075143". Each 4 characters represent a Chinese character. When restoring, only "" needs to be added before every 4 characters. The marked E1 to E6 are 878d, 8d44, 0031, 0030, 4e07, and 5143 respectively, all of which are hexadecimal numbers. The obtained max(E) is 8d44. A storage loop is set up, and 8d44 data nodes are evenly set on the storage loop, and numbered as S i , 1 ≤ i ≤ 8d44, as Figure 2 shown, Figure 2 the black circles in it are the data nodes, Figure 2 show the distribution of 4 data nodes and the distribution trend of the data nodes. The interval between every two adjacent data nodes is the same. The numbers at the data nodes represent their S i sequence number i in;

[0068] Set a distributed storage node with the number of the first node on the storage loop. The distributed storage nodes are evenly distributed on the storage loop and coincide with one of the data nodes. Mark the S i corresponding to the distributed storage node as T i , and number the distributed storage nodes in ascending order of the sequence number i in T i , represented by the symbol P j , where j is a non-zero natural number and j is the sequence number of P, and the maximum value of j is the number of the first node;

[0069] Find the data node S n corresponding to E i , marked as R n , and allocate E n to the P n closest to R j for storage;

[0070] In practical applications, the number of the first node is set by the user himself. In this embodiment, the number of the first node is set to 4. 8d44÷4 is calculated to be 2351. Therefore, 1 is used as the first distributed storage node, and then a distributed storage node is set every 2351 data nodes thereafter. Figure 2 The 4 data nodes in are the distributed storage nodes in this embodiment. The above numbers are all hexadecimal numbers; the value of E n is the sequence number i of R i . Taking E3 as an example, E3 is 0031, and the corresponding data node is R 31 , which is closest to the distributed storage node P1. Therefore, E3 is allocated to P1 for storage. Encryption and dynamic conversion need to be performed before storage;

[0071] The encryption calculation unit is used to perform encryption calculation on platform data based on the platform encryption key to obtain encrypted data;

[0072] The encryption calculation unit is configured with an encryption calculation strategy, and the encryption calculation strategy includes:

[0073] For any E n , add "n / " before the original Unicode encoding, excluding the quotation marks, and mark the modified E n as F n ;

[0074] For any F n , number the characters in F n in order from left to right, represented by the symbol H m , where m is a non-zero natural number and m is the serial number of H, convert H m to the decimal ASCII code and mark it as G m ;

[0075] Obtain the maximum value of m, marked as max(m), construct a matrix of max(m)×max(m), named the coding matrix, number each data cell in the coding matrix, represented by the symbol K(a,b), where a and b are both non-zero natural numbers and (a,b) is the serial number of K, 1≤a≤max(m), 1≤b≤max(m), fill G m into K(m,m), and set the remaining K(a,b) to be 0;

[0076] In practical applications, taking E3 as an example, the modified F3 is "3 / 0031", the numbered H1 to H6 are "3", " / ", "0", "0", "3", and "1" in sequence, the converted decimal ASCII codes G1 to G6 are 51, 47, 48, 48, 51, and 49 in sequence, max(m) is 6, construct a 6×6 matrix, and fill it based on G m to obtain the coding matrix as

[0077] Obtain the platform encryption key, number the characters in the platform encryption key in order from left to right, represented by the symbol D c , where c is a non-zero natural number and c is the serial number of D, construct another coding matrix, named the key matrix, number each data cell in the key matrix, represented by the symbol L(a,b), fill D c into L(c,c), and set the remaining L(a,b) to be 0;

[0078] In practical applications, the platform encryption key is "217178716737117055765393582500606461776". Since the encoding matrix specification is 6×6, the constructed key matrix is also 6×6. Therefore, only the first 6 digits of the platform encryption key need to be obtained, namely D1 to D6, which are 2, 1, 7, 1, 7, and 8 in sequence. Fill D1 into L(1,1), D2 into L(2,2), and so on, and the constructed key matrix is

[0079] Multiply the encoding matrix by the key matrix to obtain a calculation matrix. Number the data cells in the calculation matrix, represented by the symbol U(a,b). Obtain the minimum and maximum values in U(a,b), marked as min(U) and max(U) respectively. Randomly assign values to U(a,b) where a≠b, and the assignment range is from min(U) to max(U);

[0080] The finally obtained U(a,b) is the encrypted data;

[0081] In practical applications, the calculation matrix obtained through calculation is Among them, min(U) and max(U) are 47 and 392 respectively. Randomly assign values to U(a,b) where a≠b in the calculation matrix, and the assignment range is from 47 to 392. The final calculation matrix obtained is During subsequent decryption, only need to obtain U(a,b) where a = b for analysis, and set the rest to 0. Multiply the calculation matrix by the inverse of the key matrix to restore it to the encoding matrix;

[0082] The dynamic conversion unit is used to set dynamic conversion rules to convert the encrypted data into dynamic data;

[0083] The dynamic conversion unit is configured with dynamic conversion strategies, and the dynamic conversion strategies include:

[0084] Set dynamic delimiter symbols, including dynamic same-part delimiter and dynamic different-part delimiter. The format of the dynamic same-part delimiter is QYQ, and the format of the dynamic different-part delimiter is QyQ. Among them, Q represents any number from 0 to 9, Y represents any capital letter, and y represents any lowercase letter. Both the dynamic same-part delimiter and the dynamic different-part delimiter will change in real time;

[0085] Number U(a,b) in the order from the upper left to the lower right, first from left to right and then from top to bottom, represented by the symbol W v where v is a non-zero natural number and v is the serial number of W. For any W v , number the characters in W v in the order from left to right, represented by the symbol WG hIt is represented that, where h is a non-zero natural number and h is the serial number of WG;

[0086] Add a dynamic heterogeneous separator between every two adjacent Ws v and add a dynamic homogeneous separator between every two adjacent WGs h ;

[0087] In practical applications, after numbering, we get W1 to W 36 , taking W1 and W2 as examples, W1 is 102, where WG1 to WG3 are 1, 0, and 2 in sequence, W2 is 65, and the WG1 and WG2 belonging to W2 are 6 and 5 respectively. For W1, add a dynamic homogeneous separator between its adjacent WGs h , and add a dynamic heterogeneous separator between W1 and W2, thus obtaining "1QYQ0QYQ2QyQ6QYQ5", and based on the definitions of QYQ and QyQ, it randomly changes in real time to get "16G305U327b862T95";

[0088] For any WG h , convert WG h into a dynamic number with the first dynamic number of digits, mark the last digit in the dynamic number as the decision number, and mark the remaining digits as transformation numbers;

[0089] Add up the transformation numbers to calculate the total sum to obtain the transformation addend, add the transformation addend to the decision number, and mark the final calculation result as the judgment addend;

[0090] The transformation numbers can be transformed in real time, the decision number changes in real time based on the changes of the transformation numbers, and when the decision number changes, it is necessary to ensure that the units digit of the judgment addend is the same as that of WG h ;

[0091] Change each WG v within each W h into a dynamic number, keep the dynamic separator symbols unchanged, and the finally obtained string is the dynamic data;

[0092] In practical applications, taking WG1 of W1 as an example, WG1 of W1 is 1. There is no specific requirement for the first dynamic number of digits, which can be set by the administrator. To save storage space, usually the first dynamic number of digits should not be greater than 5. In this embodiment, the dynamic number of digits is set to 3. In this embodiment, the first digit, second digit, and third digit of the dynamic number are represented by α, β, and γ respectively, where α and β are transformation numbers, and γ is the decision number. The transformation numbers are numbers that change in real time. For example, when α and β are transformed into 5 and 7 respectively, the calculated transformation addend is 12, and 12 + γ is the judgment addend. Since WG1 of W1 is 1, it is necessary to ensure that the units digit of the judgment addend is 1, that is, γ is set to 9, and so on, for each W v within each WGh All are changed to dynamic numbers, and the dynamic delimiter remains unchanged. The resulting string is the dynamic data.

[0093] The secure storage module is used for securely storing dynamic data;

[0094] The secure storage module is configured with a secure storage policy, and the secure storage policy includes:

[0095] Storing the dynamic data in the corresponding distributed storage nodes;

[0096] When reading platform data, it is only necessary to reverse the analysis process of the dynamic data and the encrypted data. After decryption, based on the first n pairs of E n before n sequences are restored to obtain the first-stage encoding, and then the first-stage encoding is restored to Chinese to obtain the platform data;

[0097] In practical applications, the calculation matrix exemplified in this embodiment is the calculation matrix corresponding to E3. The further converted dynamic data is stored in P1. The decryption of the dynamic data can be completed by reversing the analysis process of the dynamic data and the encrypted data. This embodiment will not be specifically described. Taking F3 as an example, if F3 is "3 / 0031", then place 0031 at the third E n position.

[0098] Embodiment 2, please refer to Figure 3 As shown, the present application provides a dynamic secure storage method for a big data platform, including the following steps:

[0099] Step S1, generating a platform encryption key for the big data platform; Step S1 includes the following sub-steps:

[0100] Step S101, setting a management key by the administrator;

[0101] Step S102, calculating the hash value of the management key, converting the calculated hexadecimal hash value to decimal and marking it as the platform encryption key;

[0102] Step S103, the platform encryption key is not stored in the big data platform. It is only directly used after being converted from the management key to the platform encryption key during encryption calculation and is not stored in data form;

[0103] Step S2, allocating distributed storage nodes for the platform data and performing encryption calculation on the platform data based on the platform encryption key to obtain encrypted data, and then converting it into dynamic data; Step S2 includes the following sub-steps:

[0104] Step S201, setting distributed storage nodes and allocating the platform data to different distributed storage nodes;

[0105] Step S201 includes the following sub-steps:

[0106] Step S2011, obtain platform data, convert the platform data into hexadecimal Unicode code, and remove the prefix "\u" to obtain a first-phase code;

[0107] Step S2012, obtain the Unicode code corresponding to each character after conversion according to the order from left to right of the first phase code, marked as E n , where n is a non-zero natural number and n is the sequence number of E;

[0108] Step S2013, obtain E n The maximum value is marked as max(E), and a storage loop is set. The storage loop is a virtual circle. Max(E) data nodes are evenly set on the storage loop and numbered. The data nodes are marked as S i denoted by , where i is a non-zero natural number and i is the sequence number of S, starting with i of the data node directly above the storage loop being 1 and increasing in the clockwise direction, 1≤i≤max(E);

[0109] Step S2014: Set a first number of distributed storage nodes on the storage loop. The distributed storage nodes are evenly distributed on the storage loop and overlap with one of the data nodes. i Marked as T i , according to T i The distributed storage nodes are numbered in ascending order by the sequence number i, and the symbol P j Represents, where j is a non-zero natural number and j is the sequence number of P, and j is at most the number of the first node;

[0110] Step S2015, search E n Corresponding data node S i , marked as R n , E n Assign to R n The closest P j to store;

[0111] Step S202: encrypt the platform data based on the platform encryption key to obtain encrypted data;

[0112] Step S202 includes the following sub-steps:

[0113] Step S2021, for any E n , add "n / " before the original Unicode code, excluding quotation marks, and change the modified E n Marked as Fn ;

[0114] Step S2022. For any F n , number the characters in F n in order from left to right, denoted by symbol H m , where m is a non-zero natural number and m is the serial number of H. Convert H m to decimal ASCII code and label it as G m ;

[0115] Step S2023. Obtain the maximum value of m, denoted as max(m), construct a max(m)×max(m) matrix, named the encoding matrix, number each data cell in the encoding matrix, denoted by symbol K(a,b), where a and b are both non-zero natural numbers and (a,b) is the serial number of K, 1≤a≤max(m), 1≤b≤max(m). Fill G m into K(m,m), and set the remaining K(a,b) to 0;

[0116] Step S2024. Obtain the platform encryption key, number the characters in the platform encryption key in order from left to right, denoted by symbol D c , where c is a non-zero natural number and c is the serial number of D. Construct another encoding matrix, named the key matrix, number each data cell in the key matrix, denoted by symbol L(a,b). Fill D c into L(c,c), and set the remaining L(a,b) to 0;

[0117] Step S2025. Multiply the encoding matrix by the key matrix to obtain a calculation matrix, number the data cells in the calculation matrix, denoted by symbol U(a,b). Obtain the minimum value and the maximum value in U(a,b), denoted as min(U) and max(U) respectively. Randomly assign values to U(a,b) where a≠b, and the range of the assigned values is from min(U) to max(U);

[0118] Step S2026. The finally obtained U(a,b) is the encrypted data;

[0119] Step S203. Set a dynamic conversion rule to convert the encrypted data into dynamic data;

[0120] Step S203 includes the following sub-steps:

[0121] Step S2031, set dynamic delimiters. The dynamic delimiters include dynamic same - part delimiters and dynamic different - part delimiters. The format of the dynamic same - part delimiter is QYQ, and the format of the dynamic different - part delimiter is QyQ, where Q represents any digit from 0 to 9, Y represents any capital letter, and y represents any lowercase letter. Both the dynamic same - part delimiter and the dynamic different - part delimiter will change in real time;

[0122] Step S2032, number U(a,b) in the order from the upper - left to the lower - right, first from left to right and then from top to bottom, and represent it through the symbol W v where v is a non - zero natural number and v is the serial number of W. For any W v , number the characters in W v in the order from left to right and represent it through the symbol WG h where h is a non - zero natural number and h is the serial number of WG;

[0123] Step S2033, add a dynamic different - part delimiter between every two adjacent W v , and add a dynamic same - part delimiter between every two adjacent WG h ;

[0124] Step S2034, for any WG h , convert WG h into a dynamic number with the first dynamic number of digits, mark the last digit in the dynamic number as the decision number, and mark the remaining digits as transformation numbers;

[0125] Step S2035, add up the transformation numbers to calculate the total sum to get the transformation addend, add the transformation addend and the decision number, and mark the final calculation result as the judgment addend;

[0126] Step S2036, the transformation numbers can change in real time, the decision number changes in real time based on the change of the transformation numbers. When the decision number changes, it is necessary to ensure that the units digit of the judgment addend is the same as that of WG h ;

[0127] Step S2037, change each WG v in each W h into a dynamic number, and the dynamic delimiters remain unchanged. The finally obtained string is the dynamic data;

[0128] Step S3, perform secure storage on the dynamic data; Step S3 includes the following sub - steps:

[0129] Step S301, store the dynamic data in the corresponding distributed storage nodes;

[0130] Step S302, when reading the platform data, it is only necessary to reverse the analysis process of the dynamic data and the encrypted data. After decryption, based on the n pairs of E n sequences before F n are restored to obtain the first-stage encoding, and then the first-stage encoding is restored to Chinese to obtain the platform data.

[0131] Embodiment 3, please refer to Figure 4 as shown in Figure 4 which illustrates a schematic structural diagram of an electronic device. The electronic device may include: a processor, a communication interface, a memory, and a communication bus. Among them, the processor, the communication interface, and the memory complete mutual communication through the communication bus. The memory stores computer-readable instructions, and the processor can call the instructions in the memory. When the computer-readable instructions are executed by the processor, the steps in a dynamic security storage method of a big data platform are run to implement the following functions: generating a platform encryption key for the big data platform; allocating distributed storage nodes for the platform data and performing encryption calculation on the platform data based on the platform encryption key to obtain encrypted data, and then converting it into dynamic data; securely storing the dynamic data.

[0132] In addition, when the logical instructions in the above-mentioned memory are implemented in the form of software functional units and sold or used as an independent product, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present application. And the aforementioned storage medium includes: USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs and other various media that can store program codes.

[0133] Embodiment 4, the present application also provides a computer-readable storage medium. The present application provides a storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned dynamic security storage method of a big data platform are run to implement the following functions: generating a platform encryption key for the big data platform; allocating distributed storage nodes for the platform data and performing encryption calculation on the platform data based on the platform encryption key to obtain encrypted data, and then converting it into dynamic data; securely storing the dynamic data.

[0134] Through the description of the above embodiments, the embodiments of the present invention can be provided as a method, a system or a computer program product. Based on such an understanding, the above technical solution, in essence, or the part that contributes to the prior art can be embodied in the form of a software product, and this computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0135] In the embodiments provided in the present application, it should be understood that the disclosed system or method can be implemented in other ways. The above-described embodiments are merely illustrative. For example, the division of modules or units is only a logical function division, and there may be other division methods in actual implementation. For another example, multiple modules or units can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed coupling or direct coupling or communication connection to each other can be through some communication interfaces, and the indirect coupling or communication connection of the system, module and unit can be electrical, mechanical or other forms.

[0136] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, and are not intended to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A dynamic security storage method for a big data platform, characterized in that It includes the following steps: Generate a platform encryption key for the big data platform; Allocate distributed storage nodes for the platform data and perform encryption calculations on the platform data based on the platform encryption key to obtain encrypted data, and then transform it into dynamic data; Perform secure storage of the dynamic data.

2. The dynamic security storage method of a big data platform according to claim 1, wherein Generating a platform encryption key for the big data platform includes the following sub-steps: The administrator sets the management key; Calculate the hash value of the management key, convert the calculated hexadecimal hash value to decimal and label it as the platform encryption key; The platform encryption key is not stored in the big data platform. It is only directly used after being converted from the management key to the platform encryption key during encryption calculations and is not stored in data form.

3. The dynamic security storage method of a big data platform according to claim 2, characterized in that Allocating distributed storage nodes for the platform data and performing encryption calculations on the platform data based on the platform encryption key to obtain encrypted data, and then transforming it into dynamic data includes the following sub-steps: Set distributed storage nodes and allocate the platform data to different distributed storage nodes; Perform encryption calculations on the platform data based on the platform encryption key to obtain encrypted data; Set dynamic conversion rules to convert the encrypted data into dynamic data.

4. The dynamic secure storage method of a big data platform according to claim 3, wherein Setting distributed storage nodes and allocating the platform data to different distributed storage nodes includes the following sub-steps: Obtain the platform data, convert the platform data into hexadecimal Unicode encoding, and at the same time remove the prefix "\u" therein to obtain the first-stage encoding; Obtain the corresponding Unicode code after conversion for each character in the order from left to right according to the first-phase encoding, marked as E n , where n is a non-zero natural number and n is the serial number of E; Obtain E n The maximum value of is marked as max(E). Set up a storage loop, where the storage loop is a virtual circle. Uniformly set max(E) data nodes on the storage loop, number the data nodes, and represent them by the symbol S i where i is a non-zero natural number and i is the sequence number of S. Taking the data node directly above the storage loop as i = 1, it increases sequentially in the clockwise direction, and 1 ≤ i ≤ max(E); Set distributed storage nodes with the number of the first nodes on the storage loop. The distributed storage nodes are evenly distributed on the storage loop and coincide with one of the data nodes. Mark the S corresponding to the distributed storage nodes i as T i , and number the distributed storage nodes in ascending order of the sequence number i in T i . It is represented by the symbol P j . Among them, j is a non-zero natural number and j is the sequence number of P, and the maximum value of j is the number of the first nodes; Find E n The corresponding data node S i , mark it as R n , and assign E n to R n The closest P j for storage.

5. A dynamic security storage method for a big data platform according to claim 4, characterized in that Performing encryption calculations on the platform data based on the platform encryption key to obtain encrypted data includes the following sub-steps: For any E n , add "n / " before the original Unicode encoding, excluding the quotation marks, and mark the modified E n as F n ; For any F n , number the characters in F n in order from left to right, and represent them by the symbol H m , where m is a non-zero natural number and m is the serial number of H. Convert H m to its decimal ASCII code and label it as G m ; Obtain the maximum value of m, denoted as max(m), construct a matrix of max(m)×max(m), named the encoding matrix, number each data cell in the encoding matrix, represented by the symbol K(a,b), where both a and b are non-zero natural numbers and (a,b) is the serial number of K, 1≤a≤max(m), 1≤b≤max(m), and fill G m into K(m,m), and set the rest of K(a,b) to 0; Obtain the platform encryption key, number the characters in the platform encryption key in order from left to right, and use the symbol D c to represent it, where c is a non-zero natural number and c is the serial number of D. Construct another coding matrix, named the key matrix, number each data cell in the key matrix, and use the symbol L(a,b) to represent it. Fill D c into L(c,c), and set the rest of L(a,b) to 0; Multiply the encoding matrix by the key matrix to obtain a calculation matrix, number the data cells in the calculation matrix, represent them by the symbol U(a,b), obtain the minimum and maximum values in U(a,b), and label them as min(U) and max(U) respectively. Randomly assign values to U(a,b) where a≠b, and the range of the assignment is from min(U) to max(U); The finally obtained U(a,b) is the encrypted data.

6. The dynamic secure storage method of a big data platform according to claim 5, characterized in that Setting dynamic conversion rules to convert the encrypted data into dynamic data includes the following sub-steps: Set dynamic delimiter symbols, the dynamic delimiter symbols include dynamic same-part delimiter symbols and dynamic different-part delimiter symbols. The format of the dynamic same-part delimiter symbol is QYQ, and the format of the dynamic different-part delimiter symbol is QyQ, where Q represents any number from 0 to 9, Y represents any capital letter, and y represents any lowercase letter. Both the dynamic same-part delimiter symbol and the dynamic different-part delimiter symbol will change in real time; Number U(a, b) in the order from the upper left to the lower right, first from left to right and then from top to bottom, represented by the symbol W v where v is a non-zero natural number and v is the serial number of W. For any W v , number the characters in W v in the order from left to right, represented by the symbol WG h where h is a non-zero natural number and h is the serial number of WG; Add a dynamic different part separator between every two adjacent Ws v and add a dynamic same part separator between every two adjacent WGs h ; For any WG h , convert WG h into a dynamic number with the first dynamic number of digits, mark the last digit in the dynamic number as the decision number, and mark the remaining digits as transformation numbers; Add up the transformation numbers to calculate the total sum to obtain the transformation addend, add the transformation addend to the decision number, and label the final calculation result as the judgment addend; The transformation number can be transformed in real time, the decision number changes in real time based on the change of the transformation number, and it is necessary to ensure that the units digit of the judgment addend is the same as WG when the decision number changes. h The same; Change each W v each WG within h to a dynamic number, with the dynamic delimiter unchanged. The resulting string is the dynamic data.

7. A dynamic security storage method for a big data platform according to claim 6, characterized in that, Performing secure storage of the dynamic data includes the following sub-steps: Store the dynamic data in the corresponding distributed storage node; When reading platform data, it is only necessary to reverse the analysis process of dynamic data and encrypted data. After decryption, based on the n pairs of E sequences before F, restore them to obtain the first-stage encoding, and then restore the first-stage encoding to Chinese to obtain the platform data. n before F n Restore the sequence to obtain the first-stage encoding, and then restore the first-stage encoding to Chinese to obtain the platform data.

8. A dynamic security storage system for a big data platform, which is used to implement the dynamic security storage method for a big data platform described in any one of claims 1-7, and is characterized in that, It includes a key generation module, a dynamic encryption module, and a secure storage module; the key generation module and the secure storage module are respectively connected to the dynamic encryption module for data connection; The key generation module is used to generate a platform encryption key for the big data platform; The dynamic encryption module is used to allocate distributed storage nodes for platform data and perform encryption calculations on the platform data based on the platform encryption key to obtain encrypted data, and then transform it into dynamic data; The secure storage module is used to securely store the dynamic data.

9. An electronic device, characterized in that, It includes a processor and a memory. The memory stores computer-readable instructions. When the computer-readable instructions are executed by the processor, the steps in the method according to any one of claims 1-7 are run.

10. A storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, the steps in the method according to any one of claims 1-7 are run.

Images