Method and system for effectively protecting genetic data based on computer encryption technology

Abstract

The present invention relates to the field of gene data encryption technology, and in particular to an effective gene data protection method and system based on computer encryption technology, the method comprising: obtaining a set of gene information to be encrypted, and constructing a target evolutionary tree; determining the genetic differences between the gene information to be encrypted; segmenting all the sorted gene information to be encrypted, and determining the target similarity between every two segments to be encrypted; screening out similar gene information corresponding to each segment to be encrypted; determining the necessary protection index corresponding to each segment to be encrypted; byte padding the segment to be encrypted according to the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the byte situation added by the previous segment to be encrypted and the corresponding necessary protection index; encrypting according to the byte padding situation of the segment to be encrypted. The present invention realizes gene data encryption by analyzing the gene information to be encrypted, and improves the effect of encrypting gene data.

Description

Technical Field

[0001] The present invention relates to the field of gene data encryption technology, and in particular to an effective gene data protection method and system based on computer encryption technology. Background Art

[0002] With the rapid development of genomics and bioinformatics, the generation and use of genetic data has become increasingly common and important. Genetic data often contains a lot of sensitive information, such as personal identity, genetic characteristics, and disease risks, so the protection of genetic data has become crucial. At present, when encrypting data, random numbers are often added to increase the security of encryption. For example, data can be encrypted using an asymmetric encryption algorithm (RSA encryption algorithm). The PKCS-v1_5 (RSAES-PKCS1-v1_5) encoding scheme of the RSA encryption algorithm improves the encryption effect by adding random numbers before the original data segment.

[0003] However, when encrypting genetic data using the RSA encryption algorithm, the following technical problems often occur:

[0004] Since random numbers are generated randomly, similar random number segments may be generated when there is a relatively large amount of genetic data. Therefore, similar random number segments may be generated for similar genetic data, resulting in highly similar genetic data segments having highly similar results after encryption. This allows attackers to infer the original genetic data by analyzing the encrypted data pattern, resulting in poor encryption of the genetic data, and thus poor security of genetic data protection. Summary of the invention

[0005] In order to solve the technical problem of poor encryption effect of genetic data, the present invention proposes an effective genetic data protection method and system based on computer encryption technology.

[0006] In a first aspect, the present invention provides an effective genetic data protection method based on computer encryption technology, the method comprising:

[0007] Obtaining a set of gene information to be encrypted, and constructing a target evolutionary tree based on the set of gene information to be encrypted;

[0008] Based on the target evolutionary tree, determine the genetic difference between every two genetic information to be encrypted, and sort all the genetic information to be encrypted based on the genetic difference;

[0009] Segment all the sorted gene information to be encrypted to obtain sorted segments to be encrypted, and determine the target similarity between each two segments to be encrypted based on the edit distance between each two segments to be encrypted;

[0010] According to the genetic difference between the genetic information to be encrypted to which each segment to be encrypted belongs and other genetic information to be encrypted, similar genetic information is screened out from all other genetic information to be encrypted;

[0011] Determine the necessary protection index corresponding to each segment to be encrypted according to the target similarity between each segment to be encrypted and all the segments to be encrypted in all the corresponding similar gene information;

[0012] Filling the preset filling position in the first segment to be encrypted with random bytes, and for the segments to be encrypted other than the first segment to be encrypted, performing byte padding on the segments to be encrypted other than the first segment to be encrypted according to the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the bytes added to the previous segment to be encrypted and the corresponding necessary protection indicators;

[0013] Encryption is performed based on the byte padding of the segment to be encrypted.

[0014] In combination with the first aspect above, in a possible implementation, the sorting of all the genetic information to be encrypted based on genetic differences includes:

[0015] Randomly select one piece of genetic information to be encrypted from all the genetic information to be encrypted as the initial encrypted genetic information;

[0016] Determine each piece of genetic information to be encrypted except the initial encrypted genetic information as reference encrypted genetic information;

[0017] According to the genetic differences between the initial encrypted genetic information and each reference encrypted genetic information, all reference encrypted genetic information are sorted in descending order to obtain a reference encrypted genetic information sequence;

[0018] The initial encrypted gene information is arranged before the reference encrypted gene information sequence to obtain all arranged gene information to be encrypted.

[0019] In combination with the first aspect above, in a possible implementation, segmenting all sorted genetic information to be encrypted to obtain sorted segments to be encrypted includes:

[0020] According to the arrangement order, all the gene information to be encrypted constitutes the target encrypted information, the target encrypted information is divided into equal parts, and the sub-segments obtained by the equal division are determined as the segments to be encrypted, so as to obtain the sorted segments to be encrypted.

[0021] In combination with the first aspect, in a possible implementation manner, determining the target similarity between each two segments to be encrypted according to the edit distance between each two segments to be encrypted includes:

[0022] Filtering a reference representative encryption segment set corresponding to each to-be-encrypted segment from the target encryption information;

[0023] Determine any two to-be-encrypted segments as a first marker segment and a second marker segment respectively;

[0024] Filtering out the minimum edit distance from the edit distances between the reference representative encrypted segments in the reference representative encrypted segment set corresponding to the first marking segment and the second marking segment as the first difference distance between the first marking segment and the second marking segment;

[0025] Filtering out the minimum edit distance from the edit distances between each reference representative encrypted segment in the reference representative encrypted segment set corresponding to the first marking segment and the second marking segment as the second difference distance between the first marking segment and the second marking segment;

[0026] Determine a smaller value between the first difference distance and the second difference distance as a target difference distance between the first marking segment and the second marking segment;

[0027] The target similarity between the first marking segment and the second marking segment is determined according to the target difference distance between the first marking segment and the second marking segment, wherein the target difference distance is negatively correlated with the target similarity.

[0028] In combination with the first aspect above, in a possible implementation manner, the step of selecting a reference representative encryption segment set corresponding to each to-be-encrypted segment from the target encryption information includes:

[0029] Determine any segment to be encrypted as a reference encryption segment;

[0030] Filtering out a preset number of bytes that are before the reference encryption segment and closest to the reference encryption segment from the target encrypted information to form a set of preceding adjacent bytes corresponding to the reference encryption segment;

[0031] Filtering out a preset number of bytes after the reference encryption segment and closest to the reference encryption segment from the target encryption information to form a set of subsequent adjacent bytes corresponding to the reference encryption segment;

[0032] The reference encrypted segment and its corresponding preceding adjacent byte set and following adjacent byte set are combined to form a representative data segment corresponding to the reference encrypted segment;

[0033] Constructing a target window with a length equal to the length of the reference encrypted segment, moving the target window within the representative data segment, and forming a reference representative encrypted segment of the reference encrypted segment with all bytes within the target window after each movement;

[0034] All reference representative encryption segments of the reference encryption segment constitute a reference representative encryption segment set corresponding to the reference encryption segment.

[0035] In combination with the first aspect above, in a possible implementation, the step of screening out similar gene information from all other gene information to be encrypted according to the genetic difference between the gene information to be encrypted to which each segment to be encrypted belongs and other gene information to be encrypted includes:

[0036] Determine any segment to be encrypted as a reference encryption segment, screen out gene representative information from the gene information to be encrypted to which the reference encryption segment belongs, and determine each gene information to be encrypted except the gene representative information as candidate gene information;

[0037] A preset number of candidate gene information with the smallest genetic difference from the gene representative information is screened out from all candidate gene information as similar gene information corresponding to the reference encrypted segment.

[0038] In combination with the first aspect above, in a possible implementation, determining the necessary protection index corresponding to each segment to be encrypted according to the target similarity between each segment to be encrypted and all the segments to be encrypted in all the corresponding similar gene information includes:

[0039] Determine any segment to be encrypted as a reference encryption segment;

[0040] Selecting the maximum target similarity from the target similarities between the reference encrypted segment and all the segments to be encrypted in each of the similar gene information corresponding to it, as the similarity representative factor between the reference encrypted segment and each of the similar gene information corresponding to it;

[0041] According to the similarity representative factor between the reference encrypted segment and all the corresponding similar gene information, the necessary protection index corresponding to the reference encrypted segment is determined, wherein the similarity representative factor is positively correlated with the necessary protection index.

[0042] In combination with the first aspect, in a possible implementation, the step of performing byte padding on the segments to be encrypted except the first segment to be encrypted according to the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the bytes added to the previous segment to be encrypted and the corresponding necessary protection index, includes:

[0043] Determine any segment to be encrypted except the first segment to be encrypted as a candidate encryption segment, determine any preset filling position in the candidate encryption segment as a candidate filling position, and determine each segment to be encrypted before the candidate encryption segment as a pending encryption segment;

[0044] Taking the bytes filled at the same position as the candidate filling position in the pending encryption segment as the mean and the inverse of the necessary protection index corresponding to the pending encryption segment as the standard deviation, a normal distribution is constructed to obtain a target probability density function at the same position as the candidate filling position in the pending encryption segment;

[0045] Determine the filling probability of each preset byte to be filled at the candidate filling position in the candidate encryption segment according to the target similarity between the candidate encryption segment and all pending encryption segments, and the target probability density function at the same position as the candidate filling position in all pending encryption segments;

[0046] The candidate filling positions in the candidate encryption segment are byte filled according to the filling probabilities of all kinds of preset bytes to be filled at the candidate filling positions.

[0047] In combination with the first aspect above, in a possible implementation, the formula corresponding to the filling probability of the preset byte to be filled at the candidate filling position in the candidate encryption segment is:

[0048] ;in, It is A filling probability of a preset byte to be filled at a candidate filling position in the candidate encryption segment; It is the type number of the preset bytes to be filled; is a normalization function; F is the number of pending encryption segments; L is the sequence number of the pending encryption segment; is the target similarity between the candidate encrypted segment and the Lth pending encrypted segment; is the target probability density function at the same position as the candidate filling position in the Lth undetermined encryption segment, when the independent variable takes the value equal to the The function value of a preset byte to be filled.

[0049] In a second aspect, the present invention provides an effective genetic data protection system based on computer encryption technology, the system comprising:

[0050] An information acquisition construction module is used to obtain a set of gene information to be encrypted, and to construct a target evolutionary tree based on the set of gene information to be encrypted;

[0051] A sorting module is used to determine the genetic difference between each pair of genetic information to be encrypted based on the target evolutionary tree, and sort all the genetic information to be encrypted based on the genetic difference;

[0052] A segmentation processing determination module is used to segment all the sorted gene information to be encrypted to obtain sorted segments to be encrypted, and determine the target similarity between each two segments to be encrypted based on the edit distance between each two segments to be encrypted;

[0053] An information screening module, used to screen out similar gene information from all other gene information to be encrypted according to the genetic differences between the gene information to be encrypted and other gene information to be encrypted to which each segment to be encrypted belongs;

[0054] An index determination module, used to determine the necessary protection index corresponding to each to-be-encrypted segment according to the target similarity between each to-be-encrypted segment and all the to-be-encrypted segments in all the corresponding similar gene information;

[0055] A byte filling module is used to fill the preset filling position in the first segment to be encrypted with random bytes, and for the segments to be encrypted other than the first segment to be encrypted, perform byte filling on the segments to be encrypted other than the first segment to be encrypted according to the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the bytes added to the previous segment to be encrypted and the corresponding necessary protection indicators;

[0056] The data encryption module is used to perform encryption according to the byte padding of the segment to be encrypted.

[0057] In a third aspect, a server is provided, comprising a memory and a processor. The memory is used to store executable program code, and the processor is used to call and run the executable program code from the memory, so that the device executes the method in the first aspect or any possible implementation of the first aspect.

[0058] In a fourth aspect, a computer program product is provided, comprising: a computer program code, which, when executed on a computer, enables the computer to execute the method in the first aspect or any possible implementation of the first aspect.

[0059] In a fifth aspect, a computer-readable storage medium is provided, which stores a computer program code. When the computer program code runs on a computer, the computer executes the method in the above-mentioned first aspect or any possible implementation manner of the first aspect.

[0060] The present invention has the following beneficial effects:

[0061] The effective genetic data protection method based on computer encryption technology of the present invention realizes genetic data encryption by analyzing the genetic information to be encrypted, solves the technical problem of poor effect of encrypting genetic data, and improves the effect of encrypting genetic data. Compared with directly filling random numbers for each genetic data segment, the present invention comprehensively considers the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the bytes added to the previous segment to be encrypted and the corresponding necessary protection indicators when filling random numbers, which can avoid generating similar random number segments for similar segments to be encrypted to a certain extent, thereby improving the effect of encrypting the genetic information to be encrypted, and further improving the security of genetic data protection. BRIEF DESCRIPTION OF THE DRAWINGS

[0062] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present invention or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0063] Figure 1 A flowchart of the method for effectively protecting genetic data based on computer encryption technology of the present invention;

[0064] Figure 2 This is a schematic diagram of the structure of the effective genetic data protection system based on computer encryption technology of the present invention;

[0065] Figure 3 The figure is a schematic diagram of the structure of a computer device of the present invention. DETAILED DESCRIPTION

[0066] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the specific implementation methods, structures, features and effects of the technical solutions proposed by the present invention are described in detail below in conjunction with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.

[0067] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.

[0068] refer to Figure 1 , shows the process of some embodiments of the method for effectively protecting genetic data based on computer encryption technology of the present invention. The method for effectively protecting genetic data based on computer encryption technology includes the following steps:

[0069] Step S1, obtaining a set of gene information to be encrypted, and constructing a target evolutionary tree based on the set of gene information to be encrypted.

[0070] The gene information to be encrypted in the gene information set to be encrypted may be the gene information to be encrypted. The gene information may be a nucleotide sequence representing a gene. The nucleotide sequence is a sequence obtained by arranging the bases in DNA (Deoxyribonucleic Acid) or RNA (Ribonucleic Acid).

[0071] As an example, multiple nucleotide sequences that need to be encrypted can be collected, and based on these nucleotide sequences, an evolutionary tree can be constructed through branching phylogenetic analysis. The collected nucleotide sequences can constitute a set of gene information to be encrypted, and the constructed evolutionary tree can be used as the target evolutionary tree. Among them, branching phylogenetic analysis is a method used to study species or sequence evolution and systematic classification, and to calculate the evolutionary relationship between organisms through mathematical statistics algorithms. The evolutionary tree, also known as the phylogenetic evolutionary tree and the phylogenetic evolutionary tree, can use tree-like branching graphics to represent the relationship between genes.

[0072] It should be noted that when analyzing genetic data, the analysis of the evolutionary tree is an important analysis step. It uses tree-like branching graphics to represent the relationship between species or genes, which can reveal information such as the evolutionary relationship between species, the evolutionary history and function of genes. For example, by comparing the genetic information of different individuals in the same species, an evolutionary tree can be constructed to show the genetic relationship between individuals; for virus strains or bacterial strains in the same species, the source of the epidemic, the transmission path and the evolution process of different strains can be tracked by constructing an evolutionary tree. Genetic information is often stored in sequence data, which mainly includes adenine, thymine, cytosine, uracil and guanine. In the evolutionary tree, relatively long branches represent larger genetic differences, while shorter branches represent smaller genetic differences. The embodiment of the present invention encrypts the genetic data based on the genetic differences of different genetic data in the evolutionary tree.

[0073] Step S2, based on the target evolutionary tree, determine the genetic difference between every two pieces of genetic information to be encrypted, and sort all the genetic information to be encrypted based on the genetic difference.

[0074] It should be noted that in order to reduce the unpredictability of genetic information in the subsequent encryption process, before encrypting multiple genetic data, the genetic differences between the genetic information are considered and the genetic information to be encrypted is sorted.

[0075] As an example, this step may include the following steps:

[0076] The first step is to determine the genetic differences between each two genetic information to be encrypted based on the target evolutionary tree.

[0077] For example, the cumulative value of the evolutionary distances between all adjacent nodes in the shortest path between each two nodes of the genetic information to be encrypted can be determined as the genetic difference between the two genetic information to be encrypted. The shortest path between two nodes is the path with the smallest cumulative value of the evolutionary distances between all adjacent nodes between the two nodes. The evolutionary distance is also called the evolutionary branch length or genetic variability.

[0078] In the second step, a piece of genetic information to be encrypted is randomly selected from all the genetic information to be encrypted as the initial encrypted genetic information.

[0079] In the third step, each piece of genetic information to be encrypted except the above-mentioned initial encrypted genetic information is determined as reference encrypted genetic information.

[0080] The fourth step is to sort all reference encrypted genetic information in descending order according to the genetic differences between the initial encrypted genetic information and each reference encrypted genetic information to obtain a reference encrypted genetic information sequence.

[0081] It should be noted that, when the genetic difference between the reference encrypted genetic information and the initial encrypted genetic information is greater, it often means that the reference encrypted genetic information is ranked higher.

[0082] The fifth step is to arrange the initial encrypted gene information before the reference encrypted gene information sequence to obtain all the arranged gene information to be encrypted.

[0083] For example, if the reference encrypted gene information sequence is {first reference gene information, second reference gene information, third reference gene information}, the final sorted gene information to be encrypted is: initial encrypted gene information, first reference gene information, second reference gene information and third reference gene information.

[0084] Step S3, segmenting all the sorted gene information to be encrypted to obtain sorted segments to be encrypted, and determining the target similarity between every two segments to be encrypted according to the edit distance between every two segments to be encrypted.

[0085] As an example, this step may include the following steps:

[0086] In the first step, all the genetic information to be encrypted is used to form target encrypted information in the order of arrangement, the target encrypted information is divided equally, and the sub-segments obtained by the equal division are determined as segments to be encrypted, thereby obtaining the sorted segments to be encrypted.

[0087] For example, all the genetic information to be encrypted can be spliced ​​together in sequence according to the arrangement order of the genetic information to be encrypted, and the information finally spliced ​​together can be used as the target encrypted information. The target encrypted information can be converted into ASCII (American Standard Code for Information Interchange) encoding, and the information finally encoded can be used as the target encoding information. Every 245 bytes in the target encoding information can be divided into a data segment as a segment to be encrypted. If the last data segment is less than 245 bytes, 0 can be added to the end to reach 245 bytes, and it can be used as a segment to be encrypted. The segments to be encrypted are sorted according to the order of the segments to be encrypted in the target encoding information, wherein the earlier the segment to be encrypted is in the target encoding information, the earlier the segment to be encrypted is sorted.

[0088] For example, if two adjacent genetic information to be encrypted are {adenine nucleotide, guanine nucleotide, cytosine nucleotide, uracil nucleotide, cytosine nucleotide} and {guanine nucleotide, guanine nucleotide, uracil nucleotide}, then after splicing these two genetic information to be encrypted, {adenine nucleotide, guanine nucleotide, cytosine nucleotide, uracil nucleotide, cytosine nucleotide, guanine nucleotide, guanine nucleotide, uracil nucleotide} can be obtained.

[0089] The second step of selecting a reference representative encryption segment set corresponding to each to-be-encrypted segment from the target encryption information may include the following sub-steps:

[0090] The first sub-step is to determine any segment to be encrypted as a reference encryption segment.

[0091] The second sub-step is to select a preset number of bytes that are before the reference encryption segment and closest to the reference encryption segment from the target encryption information to form a set of preceding adjacent bytes corresponding to the reference encryption segment.

[0092] The preset number may be a preset number, for example, 20.

[0093] It should be noted that if there are less than a preset number of bytes before the reference encryption segment, all the bytes before the reference encryption segment can constitute the previous adjacent byte set corresponding to the reference encryption segment, and if there are no bytes before the reference encryption segment, the previous adjacent byte set corresponding to the reference encryption segment can be empty.

[0094] The third sub-step is to select a preset number of bytes that are after the reference encryption segment and closest to the reference encryption segment from the target encryption information to form a set of subsequent adjacent bytes corresponding to the reference encryption segment.

[0095] It should be noted that if there are less than a preset number of bytes after the reference encryption segment, all the bytes after the reference encryption segment can constitute the subsequent adjacent byte set corresponding to the reference encryption segment, and if there are no bytes after the reference encryption segment, the subsequent adjacent byte set corresponding to the reference encryption segment can be empty.

[0096] The fourth sub-step is to combine the reference encryption segment and its corresponding front adjacent byte set and rear adjacent byte set to form a representative data segment corresponding to the reference encryption segment.

[0097] The fifth sub-step is to construct a target window whose length is equal to the length of the above-mentioned reference encryption segment, move the target window in the above-mentioned representative data segment, and use all bytes in the target window after each movement to constitute a reference representative encryption segment of the above-mentioned reference encryption segment.

[0098] The sixth sub-step is to combine all reference representative encryption segments of the above reference encryption segment into a reference representative encryption segment set corresponding to the above reference encryption segment.

[0099] In the third step, any two segments to be encrypted are respectively determined as the first marking segment and the second marking segment.

[0100] In the fourth step, the minimum edit distance is selected from the edit distances between the reference representative encrypted segments in the reference representative encrypted segment set corresponding to the first marking segment and the second marking segment as the first difference distance between the first marking segment and the second marking segment.

[0101] For example, the formula corresponding to determining the first difference distance between the first marking segment and the second marking segment may be:

[0102] ;in, is the first difference distance between the first marking segment and the second marking segment. is the minimum value function. is the edit distance between the first reference representative encrypted segment corresponding to the first marker segment and the second marker segment. is the edit distance between the first marker segment and the second reference representative encrypted segment corresponding to the second marker segment. is the edit distance between the first marker segment and the third reference representative encrypted segment corresponding to the second marker segment. is the edit distance between the jth reference representative encrypted segments corresponding to the first marker segment and the second marker segment. is the edit distance between the first marker segment and the nth reference representative encrypted segment corresponding to the second marker segment. j is the sequence number of the reference representative encrypted segment in the reference representative encrypted segment set corresponding to the second marker segment. n is the number of reference representative encrypted segments in the reference representative encrypted segment set corresponding to the second marker segment.

[0103] It should be noted that when The larger the value, the greater the difference between the jth reference representative encryption segment corresponding to the first marker segment and the second marker segment. The larger it is, the greater the genetic difference between the first marker segment and the second marker segment.

[0104] In the fifth step, the minimum edit distance is selected from the edit distances between each reference representative encrypted segment in the reference representative encrypted segment set corresponding to the first marking segment and the second marking segment as the second difference distance between the first marking segment and the second marking segment.

[0105] For example, the formula corresponding to determining the second difference distance between the first marking segment and the second marking segment may be:

[0106] ;in, is the second difference distance between the first marking segment and the second marking segment. is the minimum value function. It is the edit distance between the first reference representative encrypted segment corresponding to the first marker segment and the second marker segment. It is the edit distance between the second reference representative encrypted segment corresponding to the first marker segment and the second marker segment. It is the edit distance between the third reference representative encrypted segment corresponding to the first marker segment and the second marker segment. is the edit distance between the i-th reference representative encrypted segment corresponding to the first marker segment and the second marker segment. is the edit distance between the Nth reference representative encryption segment corresponding to the first marker segment and the second marker segment. i is the sequence number of the reference representative encryption segment in the reference representative encryption segment set corresponding to the first marker segment. N is the number of reference representative encryption segments in the reference representative encryption segment set corresponding to the first marker segment.

[0107] It should be noted that when The larger the value, the greater the difference between the i-th reference representative encryption segment and the second marker segment corresponding to the first marker segment. The larger it is, the greater the genetic difference between the first marker segment and the second marker segment.

[0108] In a sixth step, a smaller value between the first difference distance and the second difference distance is determined as a target difference distance between the first marking segment and the second marking segment.

[0109] In the seventh step, according to the target difference distance between the first marking segment and the second marking segment, the target similarity between the first marking segment and the second marking segment is determined.

[0110] Among them, the target difference distance can be negatively correlated with the target similarity.

[0111] For example, the formula corresponding to determining the target similarity between the first marking segment and the second marking segment may be:

[0112] ; Where S is the target similarity between the first marker segment and the second marker segment. is the minimum value function. is the first difference distance between the first marking segment and the second marking segment. is the second difference distance between the first marking segment and the second marking segment. A is a preset factor greater than 0, mainly used to prevent the denominator from being 0. For example, A can be 1. is the target difference distance between the first marking segment and the second marking segment.

[0113] It should be noted that when The larger the value, the greater the genetic difference between the first marker segment and the second marker segment. The larger the value, the greater the genetic difference between the first marker segment and the second marker segment. Therefore, S can represent the genetic similarity between the first marker segment and the second marker segment. The larger the value, the more similar the first marker segment and the second marker segment are.

[0114] Step S4, based on the genetic differences between the genetic information to be encrypted to which each segment to be encrypted belongs and other genetic information to be encrypted, similar genetic information is screened out from all other genetic information to be encrypted.

[0115] As an example, this step may include the following steps:

[0116] In the first step, any segment to be encrypted is determined as a reference encryption segment, gene representative information is screened out from the gene information to be encrypted belonging to the reference encryption segment, and each gene information to be encrypted except the gene representative information is determined as candidate gene information.

[0117] It should be noted that when the target encrypted information is divided equally, the last byte of the previous genetic information to be encrypted may be less than 245, and the bytes of the first part of the next genetic information to be encrypted are used to supplement it to make it 245 bytes as a segment to be encrypted. Therefore, there may be more than one genetic information to be encrypted belonging to the reference encrypted segment, so one genetic information to be encrypted can be randomly selected from the multiple genetic information to be encrypted as the gene representative information. If there is only one genetic information to be encrypted belonging to the reference encrypted segment, this genetic information to be encrypted can be used as the gene representative information.

[0118] In the second step, a preset number of candidate gene information with the smallest genetic difference with the above-mentioned gene representative information is screened out from all candidate gene information as the similar gene information corresponding to the above-mentioned reference encrypted segment, and a preset number of similar gene information corresponding to the reference encrypted segment can be obtained.

[0119] The preset number may be a preset number, for example, 10.

[0120] Step S5, determining the necessary protection index corresponding to each segment to be encrypted according to the target similarity between each segment to be encrypted and all the segments to be encrypted in all the corresponding similar gene information.

[0121] It should be noted that the to-be-encrypted segment in the similar gene information in the embodiment of the present invention is the to-be-encrypted segment that completely falls within the similar gene information.

[0122] As an example, this step may include the following steps:

[0123] In the first step, any segment to be encrypted is determined as a reference encryption segment.

[0124] In the second step, the maximum target similarity is selected from the target similarities between the reference encrypted segment and all the segments to be encrypted in each of the corresponding similar gene information as the similarity representative factor between the reference encrypted segment and each of the corresponding similar gene information.

[0125] For example, the formula for determining the similarity representative factor between the segment to be encrypted and its corresponding similar gene information may be:

[0126] ;in, is the similarity representative factor between the rth segment to be encrypted and its corresponding tth similar gene information. r is the sequence number of the segment to be encrypted. t is the sequence number of the similar gene information corresponding to the rth segment to be encrypted. a is the sequence number of the segment to be encrypted in the tth similar gene information corresponding to the rth segment to be encrypted. is the number of segments to be encrypted in the t-th similar gene information corresponding to the r-th segment to be encrypted. is the maximum value function. It is the target similarity between the rth segment to be encrypted and the first segment to be encrypted in the corresponding tth similar gene information. It is the target similarity between the rth segment to be encrypted and the second segment to be encrypted in the corresponding tth similar gene information. It is the target similarity between the rth segment to be encrypted and the third segment to be encrypted in the corresponding tth similar gene information. is the target similarity between the rth segment to be encrypted and the ath segment to be encrypted in the corresponding tth similar gene information. is the rth segment to be encrypted and its corresponding tth similar gene information The target similarity between the segments to be encrypted.

[0127] It should be noted that when The larger the value is, the higher the similarity between the rth segment to be encrypted and the ath segment to be encrypted is. The larger the value, the higher the similarity between the rth segment to be encrypted and its corresponding tth similar gene information.

[0128] The third step is to determine the necessary protection indicators corresponding to the above-mentioned reference encrypted segment based on the similarity representative factors between the above-mentioned reference encrypted segment and all the corresponding similar gene information.

[0129] Among them, similar representative factors can be positively correlated with the necessary protection indicators.

[0130] For example, the formula for determining the necessary protection index corresponding to the segment to be encrypted may be:

[0131] ;

[0132] ;

[0133] ;

[0134] ;in, is the necessary protection index corresponding to the rth segment to be encrypted. r is the sequence number of the segment to be encrypted. Characterizes the similarity between the rth segment to be encrypted and its corresponding similar gene information. Characterizes the similarity between the rth segment to be encrypted and the gene information to be encrypted other than the gene information to be encrypted to which the rth segment to be encrypted belongs. is the number of similar gene information corresponding to the rth segment to be encrypted. t is the sequence number of similar gene information corresponding to the rth segment to be encrypted. It is the similarity representative factor between the rth segment to be encrypted and its corresponding tth similar gene information. is the number of genetic information to be encrypted except the genetic information to be encrypted belonging to the rth segment to be encrypted. h is the sequence number of genetic information to be encrypted except the genetic information to be encrypted belonging to the rth segment to be encrypted. It is the similarity representative factor between the rth segment to be encrypted and the hth gene information to be encrypted except the gene information to be encrypted to which the rth segment to be encrypted belongs. is the maximum value function. It is the target similarity between the rth segment to be encrypted and the first segment to be encrypted in the hth genetic information to be encrypted. It is the target similarity between the rth segment to be encrypted and the second segment to be encrypted in the hth genetic information to be encrypted. It is the target similarity between the rth segment to be encrypted and the third segment to be encrypted in the hth genetic information to be encrypted. is the target similarity between the rth segment to be encrypted and the bth segment to be encrypted in the hth genetic information to be encrypted. is the first segment to be encrypted and the first gene information to be encrypted b is the sequence number of the segment to be encrypted in the hth gene information to be encrypted. is the number of segments to be encrypted in the hth genetic information to be encrypted.

[0135] It should be noted that when The larger the value, the higher the similarity between the rth segment to be encrypted and its corresponding tth similar gene information. The larger the value, the higher the similarity between the rth segment to be encrypted and its corresponding similar gene information. The larger the value, the more likely it is that there are more gene segments with a high degree of similarity to the rth segment to be encrypted, which often means that the rth segment to be encrypted is more likely to have a certain degree of universality, and the rth segment to be encrypted is more likely to be a relatively basic gene segment. The larger, and The smaller the value, the more likely the rth segment to be encrypted is to be a relatively uncommon gene segment, but within a certain range it has certain similarities with some other segments to be encrypted; the more likely the rth segment to be encrypted is to be a data segment representing population characteristics or genetic characteristics, for example, it may be a family hereditary gene segment, which is inherited within the family but not very common in nature. The larger it is, the more likely the rth segment to be encrypted is to be a data segment representing population characteristics or genetic characteristics, the more valuable the rth segment to be encrypted is for research, and the more protection the rth segment to be encrypted needs.

[0136] Step S6, fill the preset filling position in the first segment to be encrypted with random bytes, and for the segments to be encrypted other than the first segment to be encrypted, perform byte filling on the segments to be encrypted other than the first segment to be encrypted according to the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the bytes added to the previous segment to be encrypted and its corresponding necessary protection index.

[0137] The preset filling position may be a preset position for random byte filling. One preset filling position may be filled with one byte.

[0138] It should be noted that the embodiment of the present invention can encrypt all the segments to be encrypted by an asymmetric encryption algorithm (RSA encryption algorithm). In the RSA encryption algorithm, the length of the key can be 256 bytes. In the embodiment of the present invention, the segment to be encrypted can be composed of 245 bytes, and in the byte filling process, the identification start bytes are often filled at both ends of the byte filling, and the type identification byte can be filled in the second position of the byte filling. Therefore, when the embodiment of the present invention performs byte filling on each segment to be encrypted, 2 identification start bytes, 1 type identification byte and 8 adaptive random bytes can be filled before the segment to be encrypted. The position where these 8 adaptive random bytes are located is the preset filling position. At this time, there are 8 preset filling positions. Among them, the identification start byte can be a byte used to characterize the start or end of the byte filling. The type identification byte can be a byte used to characterize the byte type of the filling.

[0139] For example, the formula corresponding to the segment to be encrypted after byte padding can be:

[0140] ;in, It is the data segment obtained after byte padding of the rth segment to be encrypted. r is the sequence number of the segment to be encrypted. It is used to identify the starting byte and the byte at which byte filling begins or ends. It is the type identification byte, indicating that the byte type filled is an integer type. Indicates 8 adaptive random bytes for filling. At this time, the position of these 8 bytes is the preset filling position. At this time, there are 8 preset filling positions in total. It is the rth segment to be encrypted. Is the byte separator.

[0141] As an example, this step may include the following steps:

[0142] The first step is to fill the preset filling position in the first segment to be encrypted with random bytes.

[0143] For example, an integer in [0, 255] may be randomly generated as a random byte, and the randomly generated random byte may be sequentially filled into each preset filling position in the first segment to be encrypted to obtain the first segment to be encrypted after byte filling.

[0144] In the second step, any segment to be encrypted except the first segment to be encrypted is determined as a candidate encryption segment, any preset filling position in the above candidate encryption segment is determined as a candidate filling position, and each segment to be encrypted before the above candidate encryption segment is determined as a pending encryption segment.

[0145] The third step is to construct a normal distribution with the bytes filled at the same position as the above-mentioned candidate filling position in the pending encryption segment as the mean and the inverse of the necessary protection index corresponding to the pending encryption segment as the standard deviation, and obtain the target probability density function at the same position as the above-mentioned candidate filling position in the pending encryption segment, where the target probability density function is the probability density function of the constructed normal distribution.

[0146] The fourth step is to determine the filling probability of each preset byte to be filled at the candidate filling position in the above candidate encryption segment based on the target similarity between the above candidate encryption segment and all pending encryption segments, and the target probability density function at the same position as the above candidate filling position in all pending encryption segments.

[0147] The preset bytes to be filled may be pre-set bytes. For example, the preset bytes to be filled may be integers in [0, 255], which has 256 types in total.

[0148] For example, the formula corresponding to the filling probability of the preset to-be-filled byte at the candidate filling position in the candidate encryption segment may be:

[0149] ;in, It is A filling probability of a preset byte to be filled at a candidate filling position in a candidate encryption segment. It is the type and sequence number of the preset bytes to be filled. is a normalization function. F is the number of pending encryption segments. L is the sequence number of the pending encryption segment. is the target similarity between the candidate encrypted segment and the Lth pending encrypted segment. is the target probability density function at the same position as the candidate filling position in the Lth undetermined encryption segment, when the independent variable takes the value equal to the The function value of a preset byte to be filled.

[0150] It should be noted that when The larger the value, the higher the similarity between the candidate encrypted segment and the Lth pending encrypted segment. It can be characterized that the position of the candidate filling position in the Lth pending encryption segment is the same as that of the candidate filling position. The probability of preset bytes to be filled. It can be characterized that the position in the Lth pending encryption segment that is the same as the candidate filling position is not filled. There are 3 pre-set byte-to-be-filled probabilities. When the value is larger, it often indicates that the similarity between the candidate encryption segment and the Lth pending encryption segment is higher, and the position corresponding to the Lth pending encryption segment is more likely to be filled with the Lth pending encryption segment. The number of preset bytes to be filled often indicates that the first The preset bytes to be filled.

[0151] The fifth step is to perform byte filling on the candidate filling positions in the candidate encryption segment according to the filling probabilities of all types of preset bytes to be filled at the candidate filling positions.

[0152] For example, the filling probabilities of various preset bytes to be filled at the candidate filling positions may be used as sampling probabilities, the preset bytes to be filled may be randomly sampled, and the preset bytes to be filled obtained by random sampling may be filled into the candidate filling positions.

[0153] For example, if there are two preset bytes to be filled, let these two preset bytes to be filled be the first preset byte to be filled and the second preset byte to be filled, the filling probability of the first preset byte to be filled at the candidate filling position is 0.3, and the filling probability of the second preset byte to be filled at the candidate filling position is 0.7, then 3 simulated balls representing the first preset byte to be filled and 7 simulated balls representing the second preset byte to be filled can be generated, and these simulated balls can be randomly drawn, and the drawn results can be filled into the candidate filling positions.

[0154] Step S7, encrypting according to the byte padding condition of the segment to be encrypted.

[0155] As an example, the byte-padded segments to be encrypted can be encrypted using the RSA encryption algorithm, so that the size of each byte-padded segment to be encrypted matches the key length, and to a certain extent the encrypted data segments do not disclose the pattern or structure of the original data, and all encrypted data segments are sequentially synthesized into the final encrypted data file, thereby achieving encryption of all genetic information to be encrypted.

[0156] It should be noted that the main improvement of the present invention is to replace the random number segments generated by the PKCS-v1_5 encoding scheme of the RSA encryption algorithm with adaptively generated random number segments, thereby avoiding the generation of similar random number segments for similar segments to be encrypted to a certain extent, and thus improving the effect of encrypting the genetic information to be encrypted.

[0157] Optionally, the decryption process may include: decomposing the encrypted data file into the size of data segments before encryption, using the RSA decryption algorithm to decrypt each data segment, restoring it to an unencrypted data segment including byte padding, removing the padding data of each data segment according to the padding data format, such as 0x00, 0x02 and 0x00 filled in sequence, restoring the original genetic data segment, and finally synthesizing the genetic data segments after removing the padding data in sequence into complete genetic information.

[0158] refer to Figure 2 Based on the same inventive concept as the above method embodiment, the present invention provides a genetic data effective protection system based on computer encryption technology, the system includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the above computer program is executed by the processor, the steps of implementing the genetic data effective protection method based on computer encryption technology may specifically include:

[0159] The information acquisition construction module 201 is used to obtain the gene information set to be encrypted, and to construct a target evolution tree based on the gene information set to be encrypted;

[0160] A determination sorting module 202 is used to determine the genetic difference between every two genetic information to be encrypted based on the target evolutionary tree, and sort all the genetic information to be encrypted based on the genetic difference;

[0161] The segment processing determination module 203 is used to segment all the sorted gene information to be encrypted to obtain sorted segments to be encrypted, and determine the target similarity between each two segments to be encrypted according to the edit distance between each two segments to be encrypted;

[0162] The information screening module 204 is used to screen out similar gene information from all other gene information to be encrypted according to the genetic differences between the gene information to be encrypted and other gene information to be encrypted to which each segment to be encrypted belongs;

[0163] The index determination module 205 is used to determine the necessary protection index corresponding to each to-be-encrypted segment according to the target similarity between each to-be-encrypted segment and all to-be-encrypted segments in all corresponding similar gene information;

[0164] The byte padding module 206 is used to fill the preset padding position in the first segment to be encrypted with random bytes, and for the segments to be encrypted other than the first segment to be encrypted, perform byte padding on the segments to be encrypted other than the first segment to be encrypted according to the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the bytes added to the previous segment to be encrypted and the corresponding necessary protection index;

[0165] The data encryption module 207 is used to perform encryption according to the byte padding condition of the segment to be encrypted.

[0166] Figure 3 is a schematic diagram of the structure of a computer device provided by an embodiment of the present invention. Figure 3As shown, the computer device 300 includes: a memory 301, a processor 302, and a computer program 303 stored in the memory 301 and running on the processor 302, wherein when the processor 302 executes the computer program 303, the computer device can execute any one of the effective genetic data protection methods based on computer encryption technology introduced above.

[0167] Based on the same inventive concept as the above method embodiment, the present invention provides a server, including a memory and a processor. The memory is used to store executable program code, and the processor is used to call and run the executable program code from the memory, so that the device executes any of the above-mentioned methods for effectively protecting genetic data based on computer encryption technology.

[0168] Based on the same inventive concept as the above-mentioned method embodiment, the present invention provides a computer program product, which includes: computer program code, when the computer program code runs on a computer, enables the computer to execute any one of the above-mentioned effective genetic data protection methods based on computer encryption technology.

[0169] Based on the same inventive concept as the above-mentioned method embodiment, the present invention provides a computer-readable storage medium, which stores a computer program code. When the computer program code runs on a computer, the computer executes any one of the above-mentioned effective genetic data protection methods based on computer encryption technology.

[0170] In summary, the present invention analyzes the similarity of gene data in the evolutionary tree structure and adjusts the probability distribution of random numbers of data with high similarity, thereby avoiding the problem of the same encryption results for similar data segments, thereby improving the uniqueness and security of data encryption. Not only the randomness of the data is taken into account, but also the padding data of different gene data is adjusted according to the necessity of protecting different gene data segments, making the encryption result more reliable, reducing the risk of data leakage and duplication, and effectively improving the security protection capability of gene data.

[0171] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments can still be modified, or some of the technical features can be replaced by equivalents. These modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present invention, and should all be included in the protection scope of the present invention.

Claims

1. An effective genetic data protection method based on computer encryption technology, characterized in that: The following steps are involved: Obtaining a set of gene information to be encrypted, and constructing a target evolutionary tree based on the set of gene information to be encrypted; Based on the target evolutionary tree, determine the genetic difference between every two genetic information to be encrypted, and sort all the genetic information to be encrypted based on the genetic difference; Segment all the sorted gene information to be encrypted to obtain sorted segments to be encrypted, and determine the target similarity between each two segments to be encrypted based on the edit distance between each two segments to be encrypted; According to the genetic difference between the genetic information to be encrypted to which each segment to be encrypted belongs and other genetic information to be encrypted, similar genetic information is screened out from all other genetic information to be encrypted; Determine the necessary protection index corresponding to each segment to be encrypted according to the target similarity between each segment to be encrypted and all the segments to be encrypted in all the corresponding similar gene information; Filling the preset filling position in the first segment to be encrypted with random bytes, and for the segments to be encrypted other than the first segment to be encrypted, performing byte padding on the segments to be encrypted other than the first segment to be encrypted according to the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the bytes added to the previous segment to be encrypted and the corresponding necessary protection indicators; Encryption is performed according to the byte padding of the segment to be encrypted; Based on the target evolutionary tree, determine the genetic differences between each pair of genetic information to be encrypted, including: The accumulated value of the evolutionary distances between all adjacent nodes in the shortest path between each two nodes of the genetic information to be encrypted is determined as the genetic difference between the two genetic information to be encrypted; wherein the shortest path between two nodes is the path with the smallest accumulated value of the evolutionary distances between all adjacent nodes between the two nodes; The method of sorting all the genetic information to be encrypted based on genetic differences includes: Randomly select one piece of genetic information to be encrypted from all the genetic information to be encrypted as the initial encrypted genetic information; Determine each piece of genetic information to be encrypted except the initial encrypted genetic information as reference encrypted genetic information; According to the genetic differences between the initial encrypted genetic information and each reference encrypted genetic information, all reference encrypted genetic information are sorted in descending order to obtain a reference encrypted genetic information sequence; Arrange the initial encrypted gene information before the reference encrypted gene information sequence to obtain all the sorted gene information to be encrypted; The step of segmenting all the sorted gene information to be encrypted to obtain the sorted segments to be encrypted includes: According to the arrangement order, all the gene information to be encrypted constitutes the target encrypted information, the target encrypted information is equally divided, and the sub-segments obtained by the equal division are determined as the segments to be encrypted, so as to obtain the sorted segments to be encrypted; The step of determining the target similarity between each two segments to be encrypted according to the edit distance between each two segments to be encrypted includes: Filtering a reference representative encryption segment set corresponding to each to-be-encrypted segment from the target encryption information; Determine any two to-be-encrypted segments as a first marker segment and a second marker segment respectively; Filtering out the minimum edit distance from the edit distances between the reference representative encrypted segments in the reference representative encrypted segment set corresponding to the first marking segment and the second marking segment as the first difference distance between the first marking segment and the second marking segment; Filtering out the minimum edit distance from the edit distances between each reference representative encrypted segment in the reference representative encrypted segment set corresponding to the first marking segment and the second marking segment as the second difference distance between the first marking segment and the second marking segment; Determine a smaller value between the first difference distance and the second difference distance as a target difference distance between the first marking segment and the second marking segment; determining a target similarity between the first marking segment and the second marking segment according to a target difference distance between the first marking segment and the second marking segment, wherein the target difference distance is negatively correlated with the target similarity; The step of selecting a reference representative encryption segment set corresponding to each to-be-encrypted segment from the target encryption information includes: Determine any segment to be encrypted as a reference encryption segment; Filtering out a preset number of bytes that are before the reference encryption segment and closest to the reference encryption segment from the target encrypted information to form a set of preceding adjacent bytes corresponding to the reference encryption segment; Filtering out a preset number of bytes after the reference encryption segment and closest to the reference encryption segment from the target encryption information to form a set of subsequent adjacent bytes corresponding to the reference encryption segment; The reference encrypted segment and its corresponding preceding adjacent byte set and following adjacent byte set are combined to form a representative data segment corresponding to the reference encrypted segment; Constructing a target window with a length equal to the length of the reference encrypted segment, moving the target window within the representative data segment, and forming a reference representative encrypted segment of the reference encrypted segment with all bytes within the target window after each movement; All reference representative encrypted segments of the reference encrypted segment constitute a reference representative encrypted segment set corresponding to the reference encrypted segment; The method of screening out similar gene information from all other gene information to be encrypted according to the genetic difference between the gene information to be encrypted and other gene information to be encrypted, includes: Determine any segment to be encrypted as a reference encryption segment, screen out gene representative information from the gene information to be encrypted to which the reference encryption segment belongs, and determine each gene information to be encrypted except the gene representative information as candidate gene information; Screening out a preset number of candidate gene information with the smallest genetic difference from the gene representative information from all candidate gene information as similar gene information corresponding to the reference encrypted segment; Encryption according to the byte padding of the segment to be encrypted includes: encrypting the segment to be encrypted after byte padding through the RSA encryption algorithm, so that the size of each segment to be encrypted after byte padding matches the key length, and all encrypted data segments are sequentially synthesized into a final encrypted data file, thereby realizing encryption of all genetic information to be encrypted.

2. According to claim 1, a method for effectively protecting genetic data based on computer encryption technology is characterized in that: The necessary protection index corresponding to each segment to be encrypted is determined according to the target similarity between each segment to be encrypted and all the segments to be encrypted in all the corresponding similar gene information, including: Determine any segment to be encrypted as a reference encryption segment; Screening out the maximum target similarity from the target similarities between the reference encrypted segment and all the segments to be encrypted in each of the similar gene information corresponding to it, as the similarity representative factor between the reference encrypted segment and each of the similar gene information corresponding to it; According to the similarity representative factor between the reference encrypted segment and all the corresponding similar gene information, the necessary protection index corresponding to the reference encrypted segment is determined, wherein the similarity representative factor is positively correlated with the necessary protection index.

3. According to claim 1, a method for effectively protecting genetic data based on computer encryption technology is characterized in that: The step of performing byte padding on the segments to be encrypted except the first segment to be encrypted according to the target similarity between the segment to be encrypted and the previous segment to be encrypted, as well as the bytes added to the previous segment to be encrypted and the corresponding necessary protection index, includes: Determine any segment to be encrypted except the first segment to be encrypted as a candidate encryption segment, determine any preset filling position in the candidate encryption segment as a candidate filling position, and determine each segment to be encrypted before the candidate encryption segment as a pending encryption segment; Taking the bytes filled at the same position as the candidate filling position in the pending encryption segment as the mean and the inverse of the necessary protection index corresponding to the pending encryption segment as the standard deviation, a normal distribution is constructed to obtain a target probability density function at the same position as the candidate filling position in the pending encryption segment; Determine the filling probability of each preset byte to be filled at the candidate filling position in the candidate encryption segment according to the target similarity between the candidate encryption segment and all pending encryption segments, and the target probability density function at the same position as the candidate filling position in all pending encryption segments; The candidate filling positions in the candidate encryption segment are byte filled according to the filling probabilities of all kinds of preset bytes to be filled at the candidate filling positions.

4. According to claim 3, a method for effectively protecting genetic data based on computer encryption technology is characterized in that: The formula corresponding to the filling probability of the preset to-be-filled byte at the candidate filling position in the candidate encryption segment is: ;in, It is A filling probability of a preset byte to be filled at a candidate filling position in the candidate encryption segment; It is the type number of the preset bytes to be filled; is a normalization function; F is the number of pending encryption segments; L is the sequence number of the pending encryption segment; is the target similarity between the candidate encrypted segment and the Lth pending encrypted segment; is the target probability density function at the same position as the candidate filling position in the Lth undetermined encryption segment, when the independent variable takes the value equal to the The function value of a preset byte to be filled.

5. An effective genetic data protection system based on computer encryption technology, characterized in that: The invention comprises a processor and a memory, wherein the processor is used to process instructions stored in the memory to implement an effective genetic data protection method based on computer encryption technology as described in any one of claims 1 to 4.

Images