Enterprise information security protection method based on digital signature technology

Abstract

The invention relates to the technical field of data security protection, and provides an enterprise information security protection method based on a digital signature technology, and the method comprises the steps: obtaining the original data of a user, and obtaining a grouping result and an information diffusion feature sequence after the original data is filled according to an information digest algorithm; calculating a plaintext hash feature coefficient according to the information diffusion feature sequence; obtaining a plaintext information adjustment coefficient and obtaining a plaintext information adjustment sequence according to the plaintext information adjustment coefficient; obtaining a constant array matrix by the constant array in the calculation process; obtaining a constant array updating matrix; and obtaining a plaintext information cooperation coefficient according to the information diffusion feature sequence, and selecting the adjacent data groups according to the plaintext information cooperation coefficient. According to the method, the security of the block chain signature is improved by adjusting the constant array and the adjacent groups in the information abstract calculation process in the digital signature.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of data security protection, and particularly relates to an enterprise information security protection method based on digital signature technology. BACKGROUND

[0002] In recent years, with the development of blockchain technology, the application range of blockchain has not been limited to digital currency, and there are successful application cases of blockchain in smart government and smart logistics. The blockchain is a chain-like data structure composed of blocks, each block contains a certain number of transaction records, and the security and non-tamperability of data are guaranteed through encryption and hash technology. The blockchain adopts a distributed consensus algorithm to realize a transaction without a trust center and remove intermediate links, so that the transaction is more secure, fast and low-cost.

[0003] In the blockchain technology, the digital signature technology ensures that the changes of information by each node in the blockchain network are traceable and verifiable. The digital signature technology can provide message authentication, identity authentication and integrity for the Internet of Things environment. In the traditional digital signature system, a user generates a signature corresponding to the data by using his own private key before sending the data, and the receiving user verifies the signature by using the public key of the sending user. The digital signature technology applied in the blockchain includes traditional digital signature, ring signature, aggregated signature and the like. Compared with the aggregated signature, the traditional digital signature has higher digital signature processing efficiency, but the security of the signature content in the traditional digital signature process is low, which leads to a higher possibility of cracking the digital signature of data in the blockchain. SUMMARY

[0004] The present application provides an enterprise information security protection method based on digital signature technology to solve the problem of low security of signature data in the blockchain. The technical solution is as follows: One embodiment of the present application provides an enterprise information security protection method based on digital signature technology, which comprises the following steps: Obtain the original data of the user, and obtain the grouping result after filling of the original data according to an information digest algorithm; According to the grouping result after filling the original data, the sub-blocks of each data group are obtained; the information diffusion index of each data group is calculated according to the sub-blocks of each data group; the information diffusion feature sequence of each data group is obtained based on the information diffusion index; the plaintext hash feature coefficient of each data group is calculated according to the information diffusion feature sequence of each data group; the plaintext information adjustment coefficient of each data group is obtained according to the information diffusion index of the sub-blocks in each data group and the plaintext hash feature coefficient of each data group; the information adjustment sequence is obtained based on the plaintext information adjustment coefficient; the constant array matrix is obtained according to the constant array in the information digest algorithm; the constant array update matrix corresponding to each data group is obtained according to the constant array matrix and the information adjustment sequence; The string corresponding to each sub-block in each data group is taken as the information feature vector of the sub-block; the plaintext information collaborative coefficient is calculated according to the information feature vector of each sub-block in each data group; the adjacent data groups are selected according to the plaintext information collaborative coefficient; the information digest of the original data of the user is obtained according to the selection result of the adjacent data groups and the constant array update matrix corresponding to each data group; and the digital signature is completed based on the information digest of the original data of the user.

[0005] Preferably, the method for obtaining the sub-blocks of each data group according to the grouping result after filling the original data is as follows: The grouping result after filling the original data is obtained according to the information digest algorithm; the length of each data group in the grouping result is 512 bits; the sequence composed of the data in each data group is taken as the data group sequence; the data group sequence is divided into 16 sub-blocks in the order from left to right, and the length of each sub-block is 32 bits; and each sub-block of the data group sequence is taken as a sub-block of each data group.

[0006] Preferably, the method for calculating the information diffusion index of each data group according to the sub-blocks of each data group and obtaining the information diffusion feature sequence of each data group based on the information diffusion index is as follows: For each data group in the grouping result after filling the original data, the EDR edit distance between the string corresponding to each sub-block in the data group and the mean value of the EDR edit distances between the strings corresponding to all other sub-blocks in the same group is taken as the information diffusion index of each sub-block; and the sequence composed of the information diffusion indices of all sub-blocks in each data group in the order from small to large is taken as the information diffusion feature sequence of each data group.

[0007] Preferably, the method for calculating the plaintext hash feature coefficient of each data group according to the information diffusion feature sequence of each data group is as follows: In the formula, n represents the number of data groups, and the number of data groups is 16; m represents the number of sub-blocks in each data group, and the number of sub-blocks in each data group is 16; and the number of data groups is equal to the number of sub-blocks in each data group. represents the information diffusion index of the i-th sub-block in the j-th data group; and represents the plaintext hash feature coefficient of the i-th sub-block in the j-th data group. a plaintext hash feature coefficient of the data packet; and respectively represent an information diffusion feature sequence of the th and the th data packet, represents the EDR edit distance between and represents the number of data packets.

[0008] Preferably, the method for obtaining the plaintext information adjustment coefficient of each sub-block in each data packet according to the information diffusion index of each sub-block in each data packet and the plaintext hash feature coefficient of each data packet is as follows: For each sub-block in each data packet in the result of the data packet filled with the original data, the information diffusion index corresponding to each sub-block is taken as the numerator, and the ratio of the numerator and the denominator is taken as the plaintext information adjustment coefficient of each sub-block; and the plaintext information adjustment coefficients corresponding to all sub-blocks in each data packet are sorted in ascending order to form a sequence as the information adjustment sequence of each data packet.

[0009] Preferably, the method for obtaining the constant array matrix according to the constant array in the information digest algorithm is as follows: In the process of calculating the MD5 value for each data packet, all constant arrays corresponding to each round of iteration are arranged in a sequence according to the subscript order as the constant array sequence corresponding to each round of iteration, and the constant array sequences corresponding to all rounds of iteration are arranged in a matrix from top to bottom according to the iteration order as the constant array matrix corresponding to each data packet.

[0010] Preferably, the method for obtaining the constant array update matrix corresponding to each data packet according to the constant array matrix and the information adjustment sequence is as follows: For each data packet in the result of the data packet filled with the original data, the arrangement order of all sub-blocks in the data packet is adjusted according to the correspondence between the elements in the information adjustment sequence of the data packet and the sub-blocks in the data packet, and the constant array matrix corresponding to the data packet is adjusted according to the adjustment result of the arrangement order of all sub-blocks in the data packet, and the adjustment result of the constant array matrix is taken as the constant array update matrix corresponding to the data packet.

[0011] Preferably, the method for calculating the plaintext information synergy coefficient according to the information feature vector of each sub-block in each data packet is as follows: In the formula, represents the ​the first coefficient of the plaintext information synergy between the two data packets; the first information feature vector corresponding to the first information feature vector corresponding to the first information feature vector corresponding to the first information feature vector corresponding to the first information feature vector corresponding to the first representing the number of sub-blocks in each data packet; representing a similarity function between two information feature vectors, representing a similarity function between two information feature vectors, and the specific calculation formula is wherein is the EDR edit distance between the strings corresponding to the two vectors.

[0012] Preferably, the method for selecting adjacent data packets according to the plaintext information synergy coefficient is as follows: For each data packet in the result of the original data padding, a sequence composed of the plaintext information synergy coefficients between the each data packet and all other data packets whose MD5 values have not been calculated in ascending order is taken as the neighbor information screening sequence of the each data packet, and the data packet corresponding to the minimum value in the neighbor information screening sequence is taken as the adjacent data packet of the each data packet. If there are multiple identical minimum values in the neighbor information screening sequence, the data packet with the smallest order number is selected as the adjacent data packet.

[0013] Preferably, the method for obtaining the information digest of the original data of the user according to the selection result of the adjacent data packets and the constant array updating matrix corresponding to each data packet, and completing the digital signature based on the information digest of the original data of the user is as follows: The MD5 value of each data packet is obtained according to the constant array updating matrix corresponding to each data packet, the MD5 value of each data packet is taken as the initial link vector of the adjacent data packet of the each data packet, the information digest of the original data of the user is obtained according to the constant array updating matrix corresponding to each data packet and the initial link vector, the digital signature result of the original data of the user is obtained by using a digital signature algorithm, and the digital signature result is stored in a blockchain network.

[0014] The beneficial effect of the present application is that the information diffusion index of each sub-block in each data packet is calculated through the analysis result of the characteristics of each data packet, the information diffusion characteristic sequence is obtained according to the information diffusion index, the plaintext hash characteristic coefficient is calculated according to the information diffusion characteristic sequence of each data packet, the plaintext information adjustment coefficient is calculated according to the information diffusion index and the plaintext hash characteristic coefficient, and the constant array is adjusted based on the plaintext information adjustment coefficient, which has the beneficial effect of reducing the relevance between the selected constant arrays and improving the security of digitally signing the information digest of the plaintext information of the user. The plaintext information coordination coefficient is calculated through the analysis result of the relevance between different data packets, the near neighbor information screening sequence is obtained according to the plaintext information coordination coefficient, and the adjacent data packets in the information digest calculation process are selected based on the near neighbor information screening sequence, which has the beneficial effect of avoiding the information digest from being cracked due to the high similarity of adjacent data packets in the information digest calculation process and improving the security of the blockchain signed data. BRIEF DESCRIPTION OF DRAWINGS

[0015] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiments or the prior art description. Obviously, the drawings in the following description only constitute some embodiments of the present application, and for those skilled in the art, other drawings can also be obtained without creative labor.

[0016] Figure 1 The flowchart of the enterprise information security protection method based on digital signature technology provided by an embodiment of the present application; Figure 2 The schematic diagram of the process of dividing each data packet into sub-blocks provided by an embodiment of the present application. DETAILED DESCRIPTION

[0017] The technical solutions in the embodiments of the present application will be described clearly and completely in the following with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments only constitute some embodiments of the present application, not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor are within the scope of protection of the present application.

[0018] It should be particularly noted that in all division operation formulas involved in the embodiments of the present application, in order to prevent the computer program from crashing or generating invalid values due to the denominator being zero, a smoothing mechanism is used. Specifically, when performing division operation, a very small positive correction factor is added to the denominator , for example, taking the value 0.001, that is, replacing the original with The calculation is performed so as to ensure robustness and implementability of the algorithm under extreme working conditions, such as a characteristic coefficient of 0. The specific calculation steps in the following text are all assumed to follow the calculation rule and will not be described again.

[0019] Referring to Figure 1 The method comprises the following steps: In step S001, original data of a user is acquired, and a grouping result of the original data after filling is acquired according to an information digest algorithm.

[0020] The original data required to be stored by the user is acquired by using a mobile terminal, and the original data includes but is not limited to transaction data, files, contract data, etc. The original data is encoded by using a UTF-8 (Unicode Transformation Format-8) encoding mode, the original data is converted into binary data, the binary data is filled and length-added according to a filling and length-adding process in an MD5 (Message-Digest Algorithm 5) algorithm, the binary data after processing is taken as plaintext information of the original data, the plaintext information of the original data is divided into data groups, the length of each data group is 512 bits, each data string of the plaintext information of the original data with a length of 512 bits is taken as a data group of the plaintext information of the original data, and the division result of the plaintext information of the original data is taken as a grouping result of the original data after filling. The specific implementation process of the UTF-8 encoding mode and the MD5 algorithm is a known technology, and will not be described again.

[0021] In step S002, an information diffusion characteristic sequence is acquired according to the grouping result of the original data after filling, a plaintext hash characteristic coefficient is calculated according to the information diffusion characteristic sequence, a plaintext information adjustment coefficient is acquired according to the plaintext hash characteristic coefficient, and a plaintext information adjustment sequence is acquired according to the plaintext information adjustment coefficient.

[0022] The MD5 value of each data group after grouping is calculated according to the grouping result of the original data after filling. Specifically, the length of each data group in the grouping result of the original data after filling is 512 bits, a sequence composed of data in each data group is taken as a data group sequence, the data group sequence is divided into 16 sub-blocks in a left-to-right order, the length of each sub-block is 32 bits, and each sub-block of the data group sequence is taken as a sub-block of each data group. Specifically, the process of dividing each data group into sub-blocks is as shown in FIG. 2. Figure 2 Each data group is taken as an input, and the MD5 value corresponding to each data group is acquired through four rounds of iteration of the MD5 algorithm, wherein the length of the MD5 value is 128 bits.

[0023] Furthermore, since the input for obtaining the MD5 value of each set of plaintext data is each data group and a constant array, where the constant array contains 64 elements, each element being 32 bits, the constant array can be represented as follows: , Indicates the first A constant array, The size is 64. Each data group is divided into 16 sub-blocks of length 32 bits, so the 16 input sub-blocks can be represented as follows: , Indicates the first A small block, The size is 16. Each data group undergoes four rounds of iterations, totaling 64 iterations. Each iteration corresponds to a constant array, and the indices of the constant array selected in each iteration are consecutive, meaning that the constant array is selected sequentially as the iteration progresses. If there are relationships between constant arrays, it may reduce the efficiency of implementing the avalanche effect.

[0024] Furthermore, the degree of diffusion of similar information is analyzed through the block segmentation results of each plaintext group, and the information diffusion index of each sub-block in each data group is calculated. Specifically, the average EDR (Edit Distance on Real sequence) edit distance between the string corresponding to each sub-block in each data group and the strings corresponding to all other sub-blocks in the same group is used as the information diffusion index of each sub-block. The larger the information diffusion index, the lower the probability that there are similar sub-blocks in each group. Furthermore, the sequence of information diffusion indices corresponding to all sub-blocks in each data group, sorted in ascending order, is used as the information diffusion feature sequence of each data group.

[0025] Furthermore, the plaintext hash feature coefficient is calculated based on the information diffusion feature sequence of each data group. The specific calculation formula is as follows: In the formula, Indicates the first Plaintext hash characteristic coefficients of each data group; and They represent the first The and the first Information diffusion characteristic sequence of data groups Indicates calculation and EDR edit distance between them; Indicates the number of data groups.

[0026] If the first The greater the difference between the information diffusion characteristics represented by the first data packet and other data packets, the greater the value of the calculated The greater the value of the plaintext hash feature coefficient , the greater the hash feature of the first data packet, that is, the lower the possibility of similar data strings appearing in the group.

[0027] Further, the information diffusion index of each sub-block in each data packet and the plaintext hash feature coefficient of each data packet are used to calculate the plaintext information adjustment coefficient. Specifically, for each sub-block in each data packet, the information diffusion index corresponding to each sub-block is taken as the numerator, the plaintext hash feature coefficient corresponding to the plaintext information is taken as the denominator, and the ratio of the numerator and the denominator is taken as the plaintext information adjustment coefficient of each sub-block. The plaintext information adjustment coefficients corresponding to each sub-block in each data packet are sorted in ascending order to form a sequence as the information adjustment sequence of each data packet.

[0028] At this point, the information adjustment sequence of each data packet is obtained.

[0029] In step S003, a constant array matrix is obtained according to the constant array in the information digest calculation process of each data packet; a constant array update matrix is obtained according to the plaintext information adjustment sequence; a plaintext information cooperative coefficient is obtained according to the information diffusion feature sequence, and adjacent data packets are selected according to the plaintext information cooperative coefficient.

[0030] The arrangement order of the sub-blocks in each data packet is adjusted according to the information adjustment sequence, and the selection order of the constant arrays is adjusted according to the adjustment result of the arrangement order of the sub-blocks in each data packet. Specifically, all constant arrays in the MD5 value calculation process of each data packet are divided according to the arrays corresponding to each round of iteration, that is, all constant arrays corresponding to the first round are , all constant arrays corresponding to the second round are , all constant arrays corresponding to the third round are , and all constant arrays corresponding to the fourth round are A constant array matrix is obtained according to the division of the constant arrays : The constant information matrix is adjusted according to the adjusted order of the sub-blocks in each data packet. Specifically, for example, the information adjustment sequence of the first data packet is , and the adjustment result of the order of the sub-blocks in each data packet is obtained according to the corresponding relationship between each element in and each sub-block in the first data packet, that is , middle Corresponding to the The 16th sub-block in the data group Since the index order of each sub-block in the first iteration of each data group corresponds one-to-one with the index order of all constant arrays in the first iteration, then according to The constant array matrix is ​​adjusted, and the result of the adjustment is used as the constant array update matrix. The constant array update matrix is ​​as follows: Therefore, the adjusted constant arrays for the first round are as follows: The constant arrays corresponding to the second round are The constant arrays corresponding to the third round are The constant arrays corresponding to the fourth round are The MD5 value of each data group is calculated based on the constant array after the order is adjusted.

[0031] During the calculation of the MD5 value for each data group, the constant array is adjusted according to the diffusion characteristics of each data group to reduce the similarity between constant arrays and improve the efficiency of realizing the avalanche effect.

[0032] Since different users need to store different characteristics of the original data, each data group generates a corresponding MD5 value during the MD5 value calculation process. The MD5 value is used as the initial link vector of the next data group. Therefore, the digest calculation process of the user's original data is a chain structure, that is, the MD5 value calculated by each group is the input of the next group. Therefore, if the similarity between adjacent plaintext information is large, it will reduce the security of data processing.

[0033] Furthermore, since each data block is 512 bits long, when dividing each data block, the 512-bit plaintext information is divided into 16 sub-blocks of 32 bits each. The string corresponding to each sub-block is used as the information feature vector of each sub-block. The plaintext information co-coefficient between two data blocks is calculated based on the information feature vector corresponding to each sub-block of each data block. The specific calculation formula is as follows: In the formula, Indicates the first The and the first The plaintext information coordination coefficient between data groups; Indicates the first In the data group, the first The information feature vectors corresponding to each sub-block Indicates the first In the data group, the first information feature vector corresponding to each sub-block; represents the number of sub-blocks in each data packet, represents a similarity function between two information feature vectors, and the specific calculation formula is , wherein is the EDR edit distance between the corresponding strings of the two vectors.

[0034] If the data distribution features and the content between the first and the first data packet are similar, the value of calculated is larger, that is, the value of the plaintext information synergy coefficient between the first and the first data packet is larger, indicating that the information distribution similarity between the first and the first data packet is larger.

[0035] According to the above calculation, the plaintext information synergy coefficient of the first data packet and all other data packets whose MD5 values are not calculated is obtained, and a sequence composed of all the plaintext information synergy coefficients in the order from small to large is taken as the neighbor information screening sequence of the first data packet. The plaintext information corresponding to the minimum value in is selected as the adjacent plaintext information of the first data packet. In order to ensure the uniqueness of the selection result, if there are multiple same minimum values in , the data packet with the smallest subscript is selected as the adjacent data packet. Specifically, for example, if the minimum value in is , the first data packet is taken as the adjacent data packet of the first data packet, and the MD5 value obtained by the first data packet is taken as the initial link vector of the first data packet. The specific implementation process of the MD5 algorithm is a known technology and will not be described here.

[0036]

[0037] Step S004, obtaining the information digest of the data according to the constant array update matrix in each data packet and the selection result of the adjacent data packet, and obtaining the data signature result according to the data digest.

[0038] According to the constant array updating matrix corresponding to each data packet, the MD5 value of each data packet is obtained, the MD5 value of each data packet is taken as the initial link vector of the adjacent data packet of the each data packet, the information digest of the original data of the user is obtained by using the MD5 algorithm according to the constant array updating matrix corresponding to each data packet and the initial link vector, the public key and the private key of the user storage data are obtained by using the RSA (Rivest-Shamir-Adleman) encryption algorithm, and the digital signature of the original data required to be stored by the user is obtained by signing the information digest according to the obtained private key, and the digital signature result is stored into the block chain network, and the specific implementation process of the MD5 algorithm and the RSA encryption algorithm is a known technology, and will not be described in detail.

[0039] Each of the embodiments in the specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other. Each of the embodiments focuses on the difference from other embodiments. The above description is only the preferred embodiment of the present application, and is not used to limit the present application. Any modification, equivalent replacement, improvement, etc. within the principle of the present application shall be included in the protection scope of the present application.

Claims

1. A method for protecting enterprise information security based on digital signature technology, characterized in that: The method includes the following steps: Obtain the user's raw data, and use the information digest algorithm to obtain the grouping results after filling the raw data; Based on the grouping results after filling in the original data, obtain sub-blocks for each data group; calculate the information diffusion index of each sub-block based on the information diffusion index, and obtain the information diffusion feature sequence for each data group based on the information diffusion feature sequence; calculate the plaintext hash feature coefficient for each data group based on the information diffusion index and the plaintext hash feature coefficient for each data group; obtain the plaintext information adjustment coefficient for each sub-block based on the information diffusion index and the plaintext hash feature coefficient for each data group, and obtain the information adjustment sequence based on the plaintext information adjustment coefficient; obtain a constant array matrix based on the constant array in the information digest algorithm; obtain the constant array update matrix corresponding to each data group based on the constant array matrix and the information adjustment sequence; The string corresponding to the sub-block in each data group is used as the information feature vector of the sub-block; the plaintext information coordination coefficient is calculated based on the information feature vector of the sub-block in each data group; adjacent data groups are selected based on the plaintext information coordination coefficient; the information digest of the user's original data is obtained based on the selection result of the adjacent data groups and the constant array update matrix corresponding to each data group; and the digital signature is completed based on the information digest of the user's original data.

2. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for obtaining sub-blocks of each data group based on the grouping results after filling in the original data is as follows: The grouping results after filling the original data are obtained according to the information digest algorithm. The length of each data group in the grouping results is 512 bits. The sequence of data in each data group is taken as the data group sequence. The data group sequence is divided into 16 sub-blocks from left to right. The length of each sub-block is 32 bits. Each sub-block of the data group sequence is taken as a sub-block of each data group.

3. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for calculating the information diffusion index of each sub-block based on each data group, and obtaining the information diffusion feature sequence of each data group based on the information diffusion index, is as follows: For each data group in the grouping result after filling the original data, the mean of the EDR edit distance between the string corresponding to each sub-block in each data group and the strings corresponding to all other sub-blocks in the same group is used as the information diffusion index of each sub-block; the sequence of information diffusion indices corresponding to all sub-blocks in each data group in ascending order is used as the information diffusion feature sequence of each data group.

4. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for calculating the plaintext hash feature coefficient of each data packet based on the information diffusion feature sequence of each data packet is as follows: In the formula, Indicates the first Plaintext hash characteristic coefficients of each data group; and They represent the first The and the first Information diffusion characteristic sequence of data groups Indicates calculation and EDR edit distance between them; Indicates the number of data groups.

5. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for obtaining the plaintext information adjustment coefficient of each data group's sub-blocks based on the information diffusion index of each data group's sub-blocks and the plaintext hash characteristic coefficient of each data group, and obtaining the information adjustment sequence based on the plaintext information adjustment coefficients, is as follows: For each sub-block in the grouping result after filling the original data, the information diffusion index corresponding to each sub-block is used as the numerator, the plaintext hash feature coefficient corresponding to each data group is used as the denominator, and the ratio of the numerator and the denominator is used as the plaintext information adjustment coefficient of each sub-block. The sequence of plaintext information adjustment coefficients corresponding to all sub-blocks in each data group, arranged in ascending order, is used as the information adjustment sequence for each data group.

6. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for obtaining the constant array matrix based on the constant array in the information digest algorithm is as follows: During the calculation of the MD5 value for each data group, the sequence of all constant arrays corresponding to each iteration in subscript order is taken as the constant array sequence corresponding to each iteration, and the matrix formed by the constant array sequences corresponding to all iterations from top to bottom in iteration order is taken as the constant array matrix corresponding to each data group.

7. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for obtaining the constant array update matrix corresponding to each data group based on the constant array matrix and the information adjustment sequence is as follows: For each data group in the grouping result after filling the original data, the order of all sub-blocks in each data group is adjusted according to the correspondence between the elements in the information adjustment sequence of each data group and the sub-blocks in each data group. The constant array matrix corresponding to each data group is adjusted according to the adjustment result of the order of all sub-blocks in each data group. The adjustment result of the constant array matrix is ​​used as the constant array update matrix corresponding to each data group.

8. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for calculating the plaintext information co-operation coefficient based on the information feature vector of sub-blocks in each data group is as follows: In the formula, Indicates the first The and the first The plaintext information coordination coefficient between data groups; Indicates the first In the data group, the first The information feature vectors corresponding to each sub-block Indicates the first In the data group, the first The information feature vectors corresponding to each sub-block; Indicates the number of sub-blocks in each data group; The similarity function between two information feature vectors is calculated using the following formula: ,in The EDR edit distance between the strings corresponding to two vectors.

9. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for selecting adjacent data groups based on the plaintext information coordination coefficient is as follows: For each data group in the grouping result after the original data is filled, the sequence of plaintext information co-coefficients between each data group and all other data groups whose MD5 values ​​have not been calculated, arranged in ascending order, is used as the nearest neighbor information filtering sequence for each data group. The data group corresponding to the minimum value in the nearest neighbor information filtering sequence is used as the adjacent data group of each data group. If there are multiple identical minimum values ​​in the nearest neighbor information filtering sequence, the data group with the smallest sort number is selected as the adjacent data group.

10. The enterprise information security protection method based on digital signature technology according to claim 1, characterized in that, The method for obtaining the information digest of the user's original data based on the selection results of adjacent data groups and the constant array update matrix corresponding to each data group, and completing the digital signature based on the information digest of the user's original data is as follows: The MD5 value of each data group is obtained by updating the constant array matrix corresponding to each data group. The MD5 value of each data group is used as the initial link vector of the adjacent data groups of each data group. The information digest of the user's original data is obtained according to the constant array update matrix and the initial link vector corresponding to each data group. The digital signature result of the user's original data is obtained by using a digital signature algorithm. The digital signature result is stored in the blockchain network.

Images