Data security encryption and decryption resource scheduling method and system

Abstract

The invention discloses a data security encryption and decryption resource scheduling method and system. The method comprises the following steps: setting code words for all cardinal numbers; setting different levels of keys according to all cardinal code words; wherein the secret key of the level 1 comprises code words of all cardinal numbers; the key of the level n comprises code words of all n-order segmented average numbers, and n is greater than 1; encrypting and encoding the data sequence according to the secret key of the level 1 to obtain an encryption result of the data sequence, and storing the encryption result; distributing keys corresponding to respective grades to different grades of personnel; and when the personnel need to check the data sequence, the data sequence is decrypted according to the respective secret key, and the decryption precision of the decrypted data sequence obtained by the personnel of different grades is different. Reasonable use requirements of different persons on data in respective work responsibility ranges are met.

Description

Technical Field

[0001] The present invention relates to the field of data encryption technology, and more specifically, to a method and system for scheduling data security encryption and decryption resources. Background Art

[0002] In today's digital age, data security and confidentiality have become crucial issues. With the rapid development of information technology, large amounts of data are generated, transmitted, and stored in various fields. This data often contains sensitive information, and its leakage can have serious consequences.

[0003] In some large enterprises and institutions, in order to better protect core secrets, prevent information leakage, and ensure that key data is accessed only by authorized personnel, it is expected to set different data access permissions for personnel at different levels.

[0004] Although symmetric encryption algorithms have high encryption efficiency, their key management is complex, and all users with keys can obtain exactly the same decryption information, making it difficult to distinguish the access rights of different users. Therefore, they can only provide a single level of encryption protection and cannot meet multi-level and multi-granular security management needs. Summary of the Invention

[0005] To solve the technical problem that the above-mentioned symmetric encryption algorithm can only provide a single level of encryption protection and cannot meet the multi-level and multi-granularity security management and control requirements, the present invention provides solutions in the following aspects.

[0006] In a first aspect, the present invention provides a data security encryption and decryption resource scheduling method, comprising: setting code words for all bases; setting keys of different levels according to the code words of all bases; wherein the key of level 1 includes the code words of all bases; and the key of level 2 includes the code words of all bases. The key includes all The codeword of the order segmented average, ;all The method of obtaining the average of the order segment and its codeword is: select from all bases The cardinality is permuted and combined to form a length of The number of combinations obtained The length of The number of combinations; the number of combinations The result of concatenating the code words of the cardinality is used as the code word of the combination number; calculate the code words that make up the combination number. The average value of the cardinal numbers is taken as the representative value of the combination number; all representative values ​​are deduplicated to obtain all The average of each stage; the representative value is equal to The code words of all combinations of the average number of the order segment are used as the code words of each The codeword of the average of the order segments is obtained; the data sequence is encrypted and encoded according to the key of level 1 to obtain the encryption result of the data sequence and store it; the keys corresponding to different levels are assigned to personnel of different levels; when personnel need to view the data sequence, the data sequence is decrypted according to their respective keys, and the decrypted data sequences obtained by personnel of different levels have different decryption accuracy.

[0007] Preferably, the cardinality is all possible data in the data sequence; data with the same value in the data sequence is used as a cardinality.

[0008] Preferably, the setting of codewords for all bases includes: setting codewords of fixed length for all bases, wherein the codewords are composed of 0 and 1; requiring codewords of different bases to be different, and requiring the fixed length to be no less than , Represents the number of types of all cardinal numbers, Indicates rounding up.

[0009] Preferably, the step of setting code words for all cardinal numbers comprises: constructing a binary tree to set code words of indefinite length for all cardinal numbers, wherein the code words are composed of 0 and 1; requiring that the number of leaf nodes on the constructed binary tree is not less than , Represents the number of types of all cardinal numbers; assigns a leaf node to each cardinality, and encodes the path from the root node to each leaf node in the binary tree as a variable-length codeword for each cardinality.

[0010] Preferably, the different levels include level 1, level 2, ..., level ,grade ,…,grade ,grade , is the number of levels, where level 1 is the highest level, and level The lowest level.

[0011] Preferably, when a person needs to view the data sequence, the information management system starts an identity authentication process, requiring the user to enter his or her registered username and password to verify the legitimacy of the user's identity and ensure that only authorized personnel can access the stored data sequence.

[0012] Preferably, the information management system will compare the username and password entered by the user with the user information stored in the database. If the entered username and password do not match or are invalid, the information management system confirms that the user authentication is incorrect; when the person who needs to view the data sequence fails to authenticate for three consecutive times, the information management system confirms that the user authentication has failed and automatically locks the account to prevent unauthorized access.

[0013] Preferably, the information management system will compare the username and password entered by the user with the user information stored in the database. If the username and password entered match and are valid, the information management system confirms that the user identity verification has passed; and then identifies the user's level and records it as the level ; Through the levels stored in the information management system The key is used to decrypt the encrypted result of the data sequence.

[0014] Preferably, the level stored in the information management system The key is used to decrypt the encrypted result of the data sequence, and it also includes: repeating each decoded data times, and obtain the final restored data sequence.

[0015] In a second aspect, the present invention provides a data security encryption and decryption resource scheduling system, comprising a processor and a memory, wherein the memory stores computer program instructions, and when the computer program instructions are executed by the processor, the above-mentioned data security encryption and decryption resource scheduling method is implemented.

[0016] By adopting the above technical solution, the above-mentioned data security encryption and decryption resource scheduling method is generated into a computer program and stored in the memory to be loaded and executed by the processor, so that a terminal device is made based on the memory and the processor for easy use.

[0017] The beneficial effects of the present invention are: The present invention provides a flexible and sophisticated solution for data encryption and decryption by setting codewords for different cardinalities and constructing keys of different levels based on all cardinalities and their codewords. The level 1 key contains the codewords of all cardinalities. The level 1 key can be used to comprehensively and meticulously encrypt the data sequence, ensuring the high confidentiality of the data during storage and transmission. At the same time, it can also ensure that the decryption accuracy of the data sequence obtained by personnel of different levels according to their respective keys is different, meeting the reasonable use of data by different personnel within the scope of their respective work responsibilities, and meeting the multi-level and multi-granular security management and control needs, effectively balancing the contradiction between data security and information sharing, and improving the security and availability of the entire information system. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 is a flow chart schematically illustrating a method for scheduling data security encryption and decryption resources in the present invention; Figure 2 is a diagram schematically illustrating a binary tree; Figure 3The present invention schematically illustrates a specific process of obtaining all combination numbers of length 2 and their code words based on all bases and their code words when a fixed length code word is set for all bases; Figure 4 The present invention schematically illustrates a specific process of obtaining all combination numbers of length 2 and their code words based on all bases and their code words when variable-length code words are set for all bases. Figure 5 The present invention schematically illustrates a specific process of obtaining all combination numbers of length 3 and their code words based on all bases and their code words when a fixed length code word is set for all bases; Figure 6 The figure schematically illustrates the specific process of obtaining all combination numbers of length 3 and their code words according to all bases and their code words when variable-length code words are set for all bases. DETAILED DESCRIPTION

[0019] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work shall fall within the scope of protection of the present invention.

[0020] The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0021] The embodiment of the present invention discloses a data security encryption and decryption resource scheduling method, referring to Figure 1 , including steps S1 to S3: S1. Set codewords for all bases, set different levels of keys according to the codewords of all bases, and allocate different memory resources for different levels of keys.

[0022] Specifically, the cardinality is all possible data in the data sequence; data with the same value in the data sequence is taken as a cardinality.

[0023] In one embodiment, a fixed-length codeword is set for all bases, and the codeword consists of 0 and 1. In order to correctly decrypt the encrypted result of the data sequence later, the codewords of different bases are required to be different. Therefore, the fixed length is required to be no less than , Represents the number of types of all cardinal numbers, Indicates rounding up.

[0024] For example, when there are 4 bases, and the 4 bases are 1, 3, 5, and 7 respectively, fixed-length codewords are set for all bases. In the first case, the codewords of the bases 1, 3, 5, and 7 can be set to 00, 01, 10, and 11. In the second case, the codewords of the bases 1, 3, 5, and 7 can be set to 000, 001, 010, and 011.

[0025] In another embodiment, a binary tree is constructed, and code words of indefinite length are set for all bases, and the code words are composed of 0 and 1. In order to correctly decrypt the encrypted result of the data sequence later, it is required that the code word of any base is not a prefix of the code word of any other base. Therefore, the number of leaf nodes on the constructed binary tree is required to be no less than , Represents the number of types of all cardinal numbers; assigns a leaf node to each cardinality, and encodes the path from the root node to each leaf node in the binary tree as a variable-length codeword for each cardinality.

[0026] For example, when there are 4 cardinal numbers, and the 4 cardinal numbers are 1, 3, 5, and 7 respectively, variable-length codewords are set for all cardinal numbers. In the first case, according to Figure 2 In the binary tree shown in (1), all bases are given code words of indefinite length, then the code words of bases 1, 3, 5, and 7 can be set to 0, 11, 100, and 101. In the second case, according to Figure 2 In the binary tree shown in (2), if we set code words of indefinite length for all bases, the code words of bases 1, 3, 5, and 7 can be set to 00, 01, 10, and 110.

[0027] Further, according to the needs of the settings levels, namely level 1, level 2, ..., level ,grade ,…,grade ,grade , where level 1 is the highest level, level The lowest level.

[0028] in, is the number of levels, the number of levels The specific value can be set according to the actual application scenario and requirements. is an integer in the range of [2,10]. Set to 3.

[0029] Furthermore, different levels of keys are set according to the codewords of all bases. The specific process is as follows: 1. All code words of all bases are combined into a key of level 1. That is, the key of level 1 includes code words of all bases.

[0030] 2. Regarding levels , :According to all cardinalities and code words of all cardinalities, obtain all The average of the stages and all The code word of the average number of order segments; all The codewords of the average number of order segments form the level The key, that is, the level The key includes all The codeword of the order segmented average.

[0031] 3. Allocate different memory resources for keys of different levels: Due to the level The key contains all the keys of length The codeword of the number of combinations of The total number of combinations is Therefore, higher-level keys contain more codewords and require more memory resources. Therefore, higher-level keys are allocated more memory resources, and appropriate resources are reasonably allocated to ensure efficient use of system resources.

[0032] Among them, according to all cardinal numbers and all cardinal code words, all The average of the stages and all The process of calculating the codeword of the step-by-step average is: (1) Select from all cardinal numbers There are a total of permutation and combination; The cardinality of the composition is Therefore, a total of The length of The number of combinations.

[0033] For example, when there are 4 cardinal numbers, 1, 3, 5, and 7, two cardinal numbers are selected from all the cardinal numbers and arranged and combined, so that there are =16 permutations and combinations, and then we get 16 combinations of length 2. These 16 combinations of length 2 are: (1,1), (1,3), (1,5), (1,7), (3,1), (3,3), (3,5), (3,7), (5,1), (5,3), (5,5), (5,7), (7,1), (7,3), (7,5), (7,7).

[0034] (2) The number of combinations The concatenation result of the code words of the base numbers is used as the code word of the combination number.

[0035] Exemplarily, when fixed-length codewords are set for all bases and the codewords of bases 1, 3, 5, and 7 are set to 00, 01, 10, and 11, the codewords of the 16 combinations of length 2 are 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, and 1111, respectively.

[0036] For example, when variable-length codewords are set for all bases, and the codewords of bases 1, 3, 5, and 7 are set to 0, 11, 100, and 101, the codewords of the 16 combinations of length 2 are 00, 011, 0100, 0101, 110, 1111, 11100, 11101, 1000, 10011, 100100, 100101, 1010, 10111, 101100, and 101101, respectively.

[0037] (3) Calculate the number of combinations The average value of the base numbers is taken as the representative value of each combination number.

[0038] Exemplarily, the representative values ​​of these 16 combination numbers with a length of 2 are: 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 7.

[0039] (4) Remove duplicates from all representative values ​​and obtain all The average of each stage; the representative value is equal to The code words of all combinations of the average number of the order segment are used as the code words of each The codeword of the order segmented average.

[0040] For example, when a fixed-length codeword is set for all cardinal numbers, the representative values ​​1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 7 of the 16 length-2 combination numbers are deduplicated, and a total of 7 types of 2-order segmented averages are obtained, namely: 1, 2, 3, 4, 5, 6, 7; among them, for the 2-order segmented average number "1", its codeword includes: 0000; for the 2-order segmented average number "2", its codeword includes: 0001, 01 00; for the second-order segmented average number "3", its code words include: 0010, 0101, 1000; for the second-order segmented average number "4", its code words include: 0011, 0110, 1001, 1100; for the second-order segmented average number "5", its code words include: 0111, 1010, 1101; for the second-order segmented average number "6", its code words include: 1011, 1110; for the second-order segmented average number "7", its code words include: 1111.

[0041] For example, when variable-length codewords are set for all cardinal numbers, the representative values ​​of the 16 length-2 combinations, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 7, are deduplicated, and a total of 7 second-order segmented averages are obtained, namely: 1, 2, 3, 4, 5, 6, 7; among them, for the second-order segmented average "1", its codewords include: 00; for the second-order segmented average "2", its codewords include: 011, 110; for the second-order segmented average "1", its codewords include: 011, 1 ...2", its codewords include: 011, 110; for the second-order segmented average "2", its codewords include: 011, 110 For the segment average number "3", its code words include: 0100, 1111, 1000; for the 2nd order segment average number "4", its code words include: 0101, 11100, 10011, 1010; for the 2nd order segment average number "5", its code words include: 100100, 11101, 10111; for the 2nd order segment average number "6", its code words include: 100101, 101100; for the 2nd order segment average number "7", its code words include: 101101.

[0042] For example, when a fixed-length codeword is set for all bases and a variable-length codeword is set for all bases, all combinations of length 2 and their codewords and all combinations of length 3 and their codewords are obtained, respectively: (1) When a fixed-length codeword is set for all bases, and the codewords of bases 1, 3, 5, and 7 are set to 00, 01, 10, and 11, the specific process of obtaining all combinations of length 2 and their codewords based on all bases and their codewords is as follows: Figure 3 shown.

[0043] (2) When all bases are set with code words of indefinite length, and the code words of bases 1, 3, 5, and 7 are set to 0, 11, 100, and 101, the specific process of obtaining all combinations of length 2 and their code words is as follows: Figure 4 shown.

[0044] (3) When a fixed-length codeword is set for all bases, and the codewords of bases 1, 3, 5, and 7 are set to 00, 01, 10, and 11, the specific process of obtaining all combinations of length 3 and their codewords based on all bases and their codewords is as follows: Figure 5 shown.

[0045] (4) When all bases are set with code words of indefinite length, and the code words of bases 1, 3, 5, and 7 are set to 0, 11, 100, and 101, the specific process of obtaining all combinations of length 3 and their code words is as follows: Figure 6 shown.

[0046] S2. Encrypt the data sequence according to the key of level 1, obtain the encryption result of the data sequence, and store it.

[0047] Specifically, each data in the data sequence is encoded according to the codeword of each base in the key of level 1 to obtain the encoding result of each data, and the concatenation result of the encoding results of all the data is used as the encryption result of the data sequence and stored.

[0048] Exemplarily, when a fixed-length codeword is set for all bases, the key of level 1 is: 1: "00", 3: "01", 5: "10", 7: "11"; when the data sequence is {7, 3, 3, 3, 1, 7, 3, 1, 3, 7, 3, 5, 1, 3, 1, 5, 7, 5}, each data in the data sequence is encoded according to the codeword of each base in the key of level 1, and the encoding results of each data are obtained, which are: 11, 01, 01, 01, 00, 11, 01, 00, 01, 11, 01, 10, 00, 01, 00, 10, 11, 10; the concatenation result of the encoding results of all the data is used as the encryption result of the data sequence, and the encryption result of the data sequence is: 110101010011010001110110000100101110.

[0049] Exemplarily, when variable-length codewords are set for all cardinal numbers, the key of level 1 is: 1: "0", 3: "11", 5: "100", 7: "101"; when the data sequence is {7, 3, 3, 3, 1, 7, 3, 1, 3, 7, 3, 5, 1, 3, 1, 5, 7, 5}, each data in the data sequence is encoded according to the codeword of each cardinality in the key of level 1, and the encoding results of each data are obtained, which are: 101, 11, 11, 11, 0, 101, 11, 0, 11, 101, 11, 100, 0, 11, 0, 100, 101, 100; the concatenation result of the encoding results of all the data is used as the encryption result of the data sequence, and the encryption result of the data sequence is: 1011111111010111011101111000110100101100.

[0050] S3. Assign keys corresponding to different levels to personnel of different levels; when personnel need to view the data sequence, they decrypt the data sequence according to their respective keys.

[0051] It should be noted that in modern information management systems, in order to ensure the security and confidentiality of data, corresponding keys are usually assigned to personnel based on their responsibilities and authority levels to ensure data security.

[0052] Specifically, the information management system stores the user's basic information and account-related information; the basic information includes name, department, position, etc., and the account-related information includes user name, password, bound email address or mobile phone number.

[0053] Furthermore, keys corresponding to different levels are assigned to personnel of different levels, and the level information of each employee is stored in the information management system.

[0054] When personnel need to view data sequences, the information management system needs to verify the user's identity to ensure that only authorized personnel can access sensitive data. Therefore, the verification process is an important part of protecting data security.

[0055] Specifically, when a person requests to view a data sequence, the information management system initiates the identity verification process and requires the user to enter their registered username and password. The information management system compares the username and password entered by the user with the user information stored in the database to verify the legitimacy of the user's identity, including: 1. If the entered username and password match and are valid, the information management system confirms that the user identity authentication is successful.

[0056] 2. If the entered username and password do not match or are invalid, the information management system confirms that the user authentication is incorrect; when the person who needs to view the data sequence fails to authenticate three times in a row, the information management system confirms that the user authentication has failed, and then the information management system will automatically lock the account to prevent unauthorized access. This locking mechanism is designed to prevent potential malicious attackers from gaining access by trying to guess the correct credentials multiple times.

[0057] 3. Once an account is locked, the user will no longer be able to log in to the information management system to view data sequences. To restore access rights, the user needs to go to the Information Department to apply for unlocking. During the application process, the user needs to provide the following information: (1) User’s basic information: including name, department, position, etc., to help the Information Department confirm the user’s identity.

[0058] (2) Account-related information: such as user name, associated email address or mobile phone number, so that the Information Department can quickly locate and handle the locked account.

[0059] (3) Specific circumstances of the lockout: including the time and location of the login attempt and the number of failed authentication attempts, which will help the Information Department understand the background of the incident and conduct an investigation.

[0060] 4. After receiving the application, the Information Department will review the user's request according to internal procedures; after confirming the user's identity, the Information Department will unlock the account and require the user to reset the password to enhance the security of the account.

[0061] Furthermore, when the information management system confirms that the user's identity verification has been passed, the user's level is determined based on the information stored in the information management system and recorded as the level ; Through the levels stored in the information management system The key is used to decrypt the encrypted result of the data sequence. The decryption accuracy of the decrypted data sequence obtained by personnel of different levels is different. times, and obtain the final restored data sequence.

[0062] For example, when a fixed-length codeword is set for all bases, the process of decrypting the encrypted result of the data sequence according to the keys of different levels is as follows: (1) When a fixed-length codeword is set for all bases, the encryption result of the data sequence is: 110101010011010001110110000100101110; and the keys for level 1 are: 1: “00”, 3: “01”, 5: “10”, 7: “11”; the keys for level 2 are: 1: “0000”, 2: “0001, 0100”, 3: “0010, 0101, 1000”, 4: “0011, 0110, 1001, 1100”, 5: “0111, 1010, 1101”, 6: “1011, 1110”, 7: “1111”.

[0063] (2) When the encrypted data sequence is decrypted using the key at level 1, the codewords obtained are: 11, 01, 01, 01, 00, 11, 01, 00, 01, 11, 01, 10, 00, 01, 00, 10, 11, 10, and the decrypted result is: 7, 3, 3, 3, 1, 7, 3, 1, 3, 7, 3, 5, 1, 3, 1, 5, 7, 5.

[0064] (3) When the encrypted data sequence is decrypted using the level 2 key, the codewords obtained are: 1101, 0101, 0011, 0100, 0111, 0110, 0001, 0010, 1110. The decrypted results are: 5, 3, 4, 2, 5, 4, 2, 3, 6. The final restored data sequence is {5, 5, 3, 3, 4, 4, 2, 2, 5, 5, 4, 4, 2, 2, 3, 3, 6, 6}.

[0065] (4) When the encrypted data sequence is decrypted using the level 3 key, the codewords obtained are: 110101, 010011, 010001, 110110, 000100, 101110. The decrypted results are: 4.3, 3.7, 2.3, 5, 1.7, 5.7. The final restored data sequence is {4.3, 4.3, 4.3, 3.7, 3.7, 3.7, 2.3, 2.3, 2.3, 5, 5, 5, 1.7, 1.7, 1.7, 5.7, 5.7, 5.7}.

[0066] For example, when codewords of variable length are set for all bases, the process of decrypting the encrypted results of the data sequence according to keys of different levels is as follows: (1) When variable-length codewords are set for all bases, the encryption result of the data sequence is: 101111111010111011101111000110100101100; and the keys for level 1 are: 1: “0”, 3: “11”, 5: “100”, 7: “101”; the keys for level 2 are: 1: “00”, 2: “011, 110”, 3: “0100, 1111, 1000”, 4: “0101, 11100, 10011, 1010”, 5: “100100, 11101, 10111”, 6: “100101, 101100”, 7: “101101”.

[0067] (2) When the encrypted data sequence is decrypted using the level 1 key, the codewords obtained are: 101, 11, 11, 11, 0, 101, 11, 0, 11, 101, 11, 100, 0, 11, 0, 100, 101, 100. The final decryption result is: 7, 3, 3, 3, 1, 7, 3, 1, 3, 7, 3, 5, 1, 3, 1, 5, 7, 5.

[0068] (3) When the encrypted data sequence is decrypted using the level 2 key, the codewords obtained are: 10111, 1111, 0101, 110, 11101, 11100, 011, 0100, 101100. The decrypted results are: 4.3, 3.7, 2.3, 5, 1.7, 5.7. The final restored data sequence is {4.3, 4.3, 4.3, 3.7, 3.7, 3.7, 2.3, 2.3, 2.3, 5, 5, 5, 1.7, 1.7, 1.7, 5.7, 5.7, 5.7}.

[0069] (4) When the encrypted data sequence is decrypted using the level 3 key, the codewords obtained are: 1011111, 110101, 11011, 10111100, 0110, 100101100. The decrypted results are: 4.3, 3.7, 2.3, 5, 1.7, 5.7. The final restored data sequence is {4.3, 4.3, 4.3, 3.7, 3.7, 3.7, 2.3, 2.3, 5, 5, 5, 1.7, 1.7, 1.7, 5.7, 5.7, 5.7}.

[0070] It should be noted that, for personnel at level 1, the decrypted result obtained by the personnel at level 1 is the same as the data in the data sequence, that is, the personnel at level 1 can decrypt and obtain the complete data sequence; for personnel at level 2, the decrypted result obtained by the personnel at level 2 is the average of the two adjacent data in the data sequence, that is, the personnel at level 2 can only decrypt and obtain the average of the two adjacent data in the data sequence, and cannot obtain the complete data sequence; for personnel at level 3, the decrypted result obtained by the personnel at level 3 is the average of the three adjacent data in the data sequence, that is, the personnel at level 3 can only decrypt and obtain the average of the three adjacent data in the data sequence, and cannot obtain the complete data sequence; therefore, the decryption accuracy of the decrypted data sequences obtained by personnel at different levels is different.

[0071] It should be further explained that the present invention provides a flexible and sophisticated solution for data encryption and decryption by setting codewords for different bases and constructing keys of different levels based on all bases and their codewords; the level 1 key contains the codewords of all bases, and the level 1 key can be used to comprehensively and meticulously encrypt the data sequence to ensure the high confidentiality of the data during storage and transmission. At the same time, it can also ensure that the decryption accuracy of the data sequence obtained by personnel of different levels according to their respective keys is different, meeting the reasonable use of data by different personnel within the scope of their respective work responsibilities, and meeting the multi-level and multi-granular security management and control needs, effectively balancing the contradiction between data security and information sharing, and improving the security and availability of the entire information system.

[0072] An embodiment of the present invention further discloses a data security encryption and decryption resource scheduling system, comprising a processor and a memory, wherein the memory stores computer program instructions. When the computer program instructions are executed by the processor, a data security encryption and decryption resource scheduling method according to the present invention is implemented.

[0073] The above system also includes other components well known to those skilled in the art, such as a communication bus and a communication interface. The configuration and functions of these components are known in the art and will not be described in detail here.

Claims

1. A data security encryption and decryption resource scheduling method, characterized in that: include: Set code words for all bases; set different levels of keys according to the code words of all bases; among them, the key of level 1 includes the code words of all bases; level The key includes all The codeword of the order segmented average, ; Allocate different memory resources for different levels of keys; all The method of obtaining the average of the order segment and its codeword is: select from all bases The cardinality is permuted and combined to form a length of The number of combinations obtained The length of The number of combinations; the number of combinations The result of concatenating the code words of the cardinality is used as the code word of the combination number; calculate the code words that make up the combination number. The average value of the cardinal numbers is used as the representative value of the number of combinations; Remove all representative values ​​and obtain all The average of each stage; the representative value is equal to The code words of all combinations of the average number of the order segment are used as the code words of each The codeword of the order segment average; Encrypt the data sequence according to the key of level 1, obtain the encryption result of the data sequence, and store it; Personnel of different levels are assigned keys corresponding to their respective levels; when personnel need to view the data sequence, the data sequence is decrypted according to their respective keys. The decryption accuracy of the decrypted data sequence obtained by personnel of different levels is different.

2. A data security encryption and decryption resource scheduling method according to claim 1, characterized in that: The cardinality is all possible data in the data sequence; the data with the same value in the data sequence is taken as a cardinality.

3. A data security encryption and decryption resource scheduling method according to claim 1, characterized in that: The step of setting codewords for all bases includes: Set a fixed-length codeword for all bases, the codeword consists of 0 and 1; require that the codewords of different bases are different, and the fixed length is not less than , Represents the number of types of all cardinal numbers, Indicates rounding up.

4. The data security encryption and decryption resource scheduling method according to claim 1, characterized in that: The step of setting codewords for all bases includes: By constructing a binary tree, all cardinal numbers are given a codeword of indefinite length, which consists of 0 and 1; the number of leaf nodes on the constructed binary tree is required to be no less than , Represents the number of types of all cardinal numbers; assigns a leaf node to each cardinality, and encodes the path from the root node to each leaf node in the binary tree as a variable-length codeword for each cardinality.

5. The data security encryption and decryption resource scheduling method according to claim 1, characterized in that: The different levels include level 1, level 2, ..., level ,grade ,…,grade ,grade , is the number of levels, where level 1 is the highest level, and level The lowest level.

6. A data security encryption and decryption resource scheduling method according to claim 1, characterized in that: When a person needs to view the data sequence, the information management system starts the identity authentication process and requires the user to enter his or her registered username and password to verify the legitimacy of the user's identity and ensure that only authorized personnel can access the stored data sequence.

7. A data security encryption and decryption resource scheduling method according to claim 6, characterized in that: The information management system will compare the username and password entered by the user with the user information stored in the database. If the username and password entered do not match or are invalid, the information management system will confirm that the user authentication is incorrect; When a person who needs to view a data sequence fails to authenticate for three consecutive times, the information management system confirms that the user's authentication has failed and automatically locks the account to prevent unauthorized access.

8. The data security encryption and decryption resource scheduling method according to claim 6, characterized in that: The information management system will compare the username and password entered by the user with the user information stored in the database. If the username and password entered match and are valid, the information management system confirms that the user's identity authentication has passed; then it identifies the user's level and records it as the level ; Through the levels stored in the information management system The key is used to decrypt the encrypted result of the data sequence.

9. A data security encryption and decryption resource scheduling method according to claim 8, characterized in that: The level stored in the information management system The key is used to decrypt the encrypted result of the data sequence, and it also includes: repeating each decoded data times, and obtain the final restored data sequence.

10. A data security encryption and decryption resource scheduling system, characterized in that: include: A processor and a memory, wherein the memory stores computer program instructions, and when the computer program instructions are executed by the processor, a data security encryption and decryption resource scheduling method according to any one of claims 1 to 9 is implemented.

Images