Method, device and apparatus for decoding information set based on weight distribution change
By adjusting the information set decoding method of variable parameters, the time complexity of the verification sub-coding problem is optimized, adapted to different computing capability scenarios, solved the security challenges of traditional algorithms under the threat of quantum computers, and achieved more efficient Decoding process.
Patent Information
- Application Number
- CN202410117718.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-01-26
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-01-26
AI Technical Summary
When facing large-scale attacks, existing information set decoding algorithms are difficult to effectively deal with the differences in computing power of different blocks, resulting in the challenge of the security of public key cryptography, especially under the threat of quantum computers, the time of traditional algorithms The complexity is high and it is difficult to meet the application scenario needs of different computing capabilities.
By adjusting variable parameters, using the information set decoding method based on the change in weight distribution, the verification sub-decoding problem is converted into a vector e1 with Hanming weight p, so that it satisfies H1e1=s1, and adjustable Hanming The pre-calculation method of weight solves e1, verifying whether e=e1+e2 satisfies wt(e)=ω, and optimizes the time complexity.
Reduces the time complexity of the information set decoding algorithm, adapts to the scenario needs of different computing capabilities, especially in the pre-computing stage to increase the weight to reduce the calculation amount, reduces the vector weight of the solution in the online calculation stage, and improves the efficiency and flexibility of the algorithm. .
Smart Images

Figure CN117914330B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a method, device and equipment for decoding information sets based on weight distribution changes, belonging to the technical field of information security. Background Art
[0002] At present, countries around the world are exploring the development of quantum computers, mainly because quantum computers can significantly improve the efficiency of cryptanalysis and cracking. Since the advent of Shor's algorithm in 1994, people have realized that once practical quantum computers are available, the current cryptographic systems based on large integer factorization problems and discrete logarithm problems will no longer be secure. In response to the challenges of quantum computers, cryptographers are turning to cryptographic systems that can resist quantum attacks. Currently, cryptographic systems that are widely believed to be able to resist quantum attacks include lattice-based cryptographic systems, code-based cryptographic systems, and multivariate-based cryptographic systems, which are also called post-quantum cryptographic systems. Among the final round of cryptographic schemes and alternatives, there are three code-based cryptographic schemes, namely McEliece, BIKE, and HQC.
[0003] The difficulty of coding-based cryptographic schemes is usually based on the syndrome decoding problem. The difficulty of the syndrome decoding problem means the security of specific post-quantum cryptographic schemes (McEliece, BIKE, HQC), so the analysis of the decoding problem has always been the focus of post-quantum cryptographic research. The patent "A decoding method and system with pre-calculation" with application number 202210831259.5 describes in detail the definition of the syndrome decoding problem and the current mainstream solution. In addition, the patent also proposes a pre-calculated variant optimized version of the syndrome decoding method currently used. However, large-scale attacks have posed new challenges to the security of public key cryptography. For example, the Logjam attack in 2015 revealed the vulnerability of existing public key cryptography under pre-calculation technology. Before the patent of "A decoding method and system with pre-calculation", the pre-calculated version of the current algorithm had not been considered in the field of syndrome decoding, so the previous information set decoding often considered the scenario of equal weight in the algorithm, in which the calculation amount of different blocks was the same. When considering pre-computation, different blocks have different calculation times and computing powers. At this time, the algorithm can be improved and analyzed based on the characteristics of equal weights.
[0004] Using different information set decoding algorithms to solve the syndrome decoding problem is still a key issue in cryptography. Therefore, in view of the characteristics of equal weights in the original algorithm, the present invention proposes a method, device and equipment for information set decoding based on weight distribution changes. Summary of the invention
[0005] In order to solve the above problems, the present invention proposes a method, device and equipment for information set decoding based on weight distribution change, which can optimize the time complexity of mainstream information set decoding algorithms through the adjustment of variable parameters.
[0006] The technical solution adopted by the present invention to solve the technical problem is:
[0007] In a first aspect, an embodiment of the present invention provides a method for decoding an information set based on a change in weight distribution, for solving a vector e with a Hamming weight equal to ω so that it satisfies He=s, where H is a parity check matrix and s is a syndrome, and the method comprises the following steps:
[0008] H is transformed into Convert the syndrome s to s = (s1, s2), only consider the operation of the upper half of the matrix, and convert the problem of solving e to solving a vector e1 with a vector length of k and a Hamming weight of p, and make e1 satisfy H1e1 = s1, where p < ω;
[0009] The vector e1 is solved by the pre-calculation method with adjustable Hamming weight, and is substituted into H2e1+e2=s2 to calculate e2, and it is verified whether e=e1+e2 satisfies wt(e)=ω.
[0010] As a possible implementation of this embodiment, the method of using the pre-calculation method with adjustable Hamming weight to solve the vector e1 includes:
[0011] Construct four reference lists L1, L2, L3, L4, where list L i The middle element is H1x i , i=1,2,3,4;
[0012] x i Defined as:
[0013]
[0014]
[0015] in, The length is Weight The set of all vectors of , α is an adjustable parameter, and Indicates that the value of its parameter is determined by the expression following it;
[0016] Construct two lists L 11 and L 12 , and based on L 11 and L 12 Construct set L 21 , so that L21 The element e1′ satisfies wt(e1′)=p, and the vector e1=e1′ is obtained.
[0017] As a possible implementation of this embodiment, the list L 11 and L 12 They are:
[0018] L 11 ={x 11 =(x1+x2)|H1x1+H1x2=t}
[0019] L 12 ={x 12 =(x3+x4)|H1x3+H1x4+s=t}
[0020] Where t is the length of A random vector of .
[0021] As a possible implementation of this embodiment, the L-based 11 and L 12 Construct set L 21 The process is: from the list L 11 and L 12 Select the one that satisfies wt(x 11 +x 12 )=p's element x 11 and x 12 , let the element in the selected set be e1′, then e1′ is the solution of element e1.
[0022] As a possible implementation of this embodiment, the parameter can be adjusted When x i The definition is as follows:
[0023]
[0024]
[0025] Among them, w belongs to the length The vector weight is The set of all vectors .
[0026] As a possible implementation of this embodiment, the parameter can be adjusted When , the lists L1 and L3 are H1 and all lists of length k and weight of the first half The lists L2 and L4 are the products of H1 and all vectors with length k, whose weights in the first half are all 0 and whose weights in the second half are The set consisting of the products of the vectors .
[0027] As a possible implementation of this embodiment, the parameter can be adjusted When the list L 11 and L 12 Element x 11 and x 12 All have length k and weight vector, and the list L 11 and L 12 The sum of the elements in s1 multiplied by H1 equals s1.
[0028] In a second aspect, an embodiment of the present invention provides a device for decoding an information set based on a change in weight distribution, which is used to solve a vector e with a Hamming weight equal to ω so that it satisfies He=s, where H is a parity check matrix and s is a syndrome, and the device includes:
[0029] The problem conversion module is used to transform H into Convert the syndrome s to s = (s1, s2), only consider the operation of the upper half of the matrix, and convert the problem of solving e to solving a vector e1 with a vector length of k and a Hamming weight of p, and make e1 satisfy H1e1 = s1, where p < ω;
[0030] The vector solving module is used to solve the vector e1 by using the pre-calculation method with adjustable Hamming weight, and substitute it into H2e1+e2=s2 to calculate e2, and verify whether e=e1+e2 satisfies wt(e)=ω.
[0031] In a third aspect, an embodiment of the present invention provides a computer device, comprising a processor, a memory and a bus, wherein the memory stores machine-readable instructions executable by the processor, and when the computer device is running, the processor communicates with the memory through the bus, and the processor executes the machine-readable instructions to perform any steps of the above-mentioned method for decoding an information set based on a change in weight distribution.
[0032] In a fourth aspect, an embodiment of the present invention provides a storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of any of the above-mentioned methods for decoding an information set based on a change in weight distribution are executed.
[0033] The technical solution of the embodiment of the present invention may have the following beneficial effects:
[0034] With respect to the currently used weight equalization algorithm, the present invention provides an improved algorithm for the currently used information set decoding algorithm whose weights can change with parameters. This improved algorithm is combined with the idea of pre-calculation in the prior art and can optimize the time complexity of the mainstream information set decoding algorithm through the adjustment of variable parameters, thereby reducing the time complexity of the general information set decoding algorithm.
[0035] The present invention increases the weight in the stage of pre-calculation with large computing power. The increase in weight will increase the amount of calculation, which is suitable for the long time of the pre-calculation stage; at the same time, in the online calculation stage, the weight of the vector to be solved is reduced, which is suitable for the small computing power of the online calculation stage. At the same time, the present invention performs a fine-grained analysis of the time complexity of each stage by adjusting the weight parameters, and adjusts the time complexity of the pre-calculation stage and the online stage to meet the needs of application scenarios with different computing powers.
[0036] The present invention aims at the equal weight characteristic of the information set decoding algorithm of the syndrome decoding problem, and proposes the idea of unequal weight. The part with high computational complexity is calculated by the pre-computation step, and the content calculated by the online calculation step is less than the content required by the original algorithm. In the pre-computation algorithm, the pre-computation step can be performed before the formal calculation, or it can be amortized to the calculation of each instance, so the complexity of the pre-computation stage is generally not estimated. Through this idea of the present invention, the complexity of the online stage is lower than the complexity of the original algorithm. The method of the present invention effectively optimizes the exponent of time complexity. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] Figure 1 is a flow chart of a method for decoding an information set based on a change in weight distribution according to an exemplary embodiment;
[0038] Figure 2 is a tree structure diagram showing a method for decoding information sets with different weight allocations according to an exemplary embodiment;
[0039] Figure 3 It is a block diagram of a device for decoding an information set based on a change in weight distribution according to an exemplary embodiment. DETAILED DESCRIPTION
[0040] The present invention will be further described below in conjunction with the accompanying drawings and embodiments:
[0041] In order to clearly illustrate the technical features of the present solution, the present invention is described in detail below through specific implementation methods and in conjunction with the accompanying drawings. The disclosure below provides many different embodiments or examples for realizing different structures of the present invention. In order to simplify the disclosure of the present invention, the components and settings of specific examples are described below. In addition, the present invention may repeat reference numbers and / or letters in different examples. This repetition is for the purpose of simplification and clarity, and does not itself indicate the relationship between the various embodiments and / or settings discussed. It should be noted that the components illustrated in the accompanying drawings are not necessarily drawn to scale. The present invention omits the description of known components and processing techniques and processes to avoid unnecessary limitations on the present invention.
[0042] The algorithm for the syndrome decoding problem with pre-calculation proposed in the patent "A decoding method and system with pre-calculation" still has room for optimization in terms of time complexity. In view of the currently used weight equalization algorithm, the present invention proposes an improved method in which the weight can change with parameters. This improved method combines the idea of pre-calculation in the patent "A decoding method and system with pre-calculation" and can optimize the time complexity of the mainstream information set decoding algorithm through the adjustment of variable parameters.
[0043] The syndrome decoding problem is to calculate the e with Hamming weight ω that satisfies the condition He = s. Where H is the parity check matrix and s is the syndrome. It can be converted into the following semi-systematic form by permuting the column vector and multiplying the matrix:
[0044]
[0045] The vector s can also be transformed into s = (s1, s2), considering only the operation of the upper half of the matrix. At this time, the problem will be transformed into solving the vector e1 with a vector length of k and a Hamming weight of p that satisfies the following conditions:
[0046] H1e1=s1
[0047] p<ω
[0048] After finding the above e1, substitute it into H2e1+e2=s2 to calculate e2 and verify whether e at this time satisfies the condition wt(e)=ω.
[0049] The above is the process of the syndrome decoding problem, which includes two parts: the first part is to permute to obtain a semi-systematic form, and the second part is to find e1 that meets the conditions and verify it. In order to find e1, the following method is usually used:
[0050] Construct four reference lists L1, L2, L3, L4, where list L i The middle element is H1x i , i = 1, 2, 3, 4. Where x i, i=1,2,3,4 are defined as follows:
[0051]
[0052]
[0053] Here w belongs to a length of The vector weight is The set A consists of all vectors of . That is, the lists L1 and L3 are H1 with all lengths k and the weight of the first half is The product of vectors whose second half is all zeros. The definitions of lists L2 and L4 are similar, except that the part with all zeros is in the first half of the vector. Using the above four benchmark lists, the following two lists L can be constructed: 11 , L 12 :
[0054] L 11 ={x 11 =(x1+x2)|H1x1+H1x2=t}
[0055] L 12 ={x 12 =(x3+x4)|H1x3+H1x4+s=t}
[0056] where t is a randomly selected vector of length k. The list L computed in this way 11 , L 12 Satisfies the following two properties. First, the element x in the list calculated in this way 11 , x 12 All have length k and weight The vector of the two sets; secondly, the sum of the elements in the two sets multiplied by H1 equals s1 (because they are all equal to t, the sum t will cancel out). These two points are the basis for solving e1.
[0057] From the above list L 11 , L 12 Construct the final set L 21 , the construction method is to select from the list L 11 , L 12 Select the one that satisfies wt(x 11 +x 12 )=p's element x 11 , x 12 , and the elements in these selected sets are recorded as e1′, then e1′ is the possible selection space of element e1. So far, the problem of finding e1 has been solved.
[0058] The following describes the variable weight adjustment of the decoding algorithm performed by the present invention and the optimization of the algorithm time complexity by pre-calculation.
[0059] In the above algorithm, we can observe that the number of elements in the sets L1, L2, L3, L4 are the same because x i The number of This is a method of selecting equal Hamming weights. In the improvement of the present invention, let:
[0060]
[0061]
[0062] in, The length is Weight The set of all vectors when When , the situation is the same as the initial algorithm of the commonly used method. When , the elements in sets L1 and L2 are more than the elements in sets L3 and L4. The parameter α represents the change that the weight can be adjusted at this time. When the number of elements in the set is greater than This also means that the time complexity at this time will be higher. This is the situation where the present invention designs a vector Hamming weight that can be adjusted.
[0063] like Figure 1 As shown, an embodiment of the present invention provides a method for decoding an information set based on a change in weight distribution, which is used to solve a vector e with a Hamming weight equal to ω so that it satisfies He=s, where H is a parity check matrix and s is a syndrome. The method comprises the following steps:
[0064] H is transformed into Convert the syndrome s to s = (s1, s2), only consider the operation of the upper half of the matrix, and convert the problem of solving e to solving a vector e1 with a vector length of k and a Hamming weight of p, and make e1 satisfy H1e1 = s1, where p < ω;
[0065] The vector e1 is solved by the pre-calculation method with adjustable Hamming weight, and is substituted into H2e1+e2=s2 to calculate e2, and it is verified whether e=e1+e2 satisfies wt(e)=ω.
[0066] As a possible implementation of this embodiment, the method of using the pre-calculation method with adjustable Hamming weight to solve the vector e1 includes:
[0067] like Figure 2As shown, four reference lists L1, L2, L3, and L4 are constructed, where list L i The middle element is H1x i , i=1,2,3,4;
[0068] x i Defined as:
[0069]
[0070]
[0071] in, The length is Weight The set of all vectors of , α is an adjustable parameter, and Indicates that the value of its parameter is determined by the expression following it;
[0072] Construct two lists L 11 and L 12 , and based on L 11 and L 12 Construct set L 21 , so that L 21 The element e1′ satisfies wt(e1′)=p, and the vector e1=e1′ is obtained.
[0073] As a possible implementation of this embodiment, Figure 2 As shown, the list L 11 and L 12 They are:
[0074] L 11 ={x 11 =(x1+x2)|H1x1+H1x2=t}
[0075] L 12 ={x 12 =(x3+x4)|H1x3+H1x4+s=t}
[0076] Where t is the length of A random vector of .
[0077] As a possible implementation of this embodiment, the L-based 11 and L 12 Construct set L 21 The process is: from the list L 11 and L 12 Select the one that satisfies wt(x 11 +x 12 )=p's element x 11 and x 12, let the element in the selected set be e1′, then e1′ is the solution of element e1.
[0078] As a possible implementation of this embodiment, the parameter can be adjusted When x i The definition is as follows:
[0079]
[0080]
[0081] Among them, w belongs to the length The vector weight is The set of all vectors .
[0082] As a possible implementation of this embodiment, the parameter can be adjusted When , the lists L1 and L3 are H1 and all lists of length k and weight of the first half The lists L2 and L4 are the products of H1 and all vectors with length k, whose weights in the first half are all 0 and whose weights in the second half are The set consisting of the products of the vectors .
[0083] As a possible implementation of this embodiment, the parameter can be adjusted When the list L 11 and L 12 Element x 11 and x 12 All have length k and weight A vector of, and the list L 11 and L 12 The sum of the elements in H1 and H1 equals s1.
[0084] like Figure 3 As shown, an embodiment of the present invention provides a device for decoding information sets based on weight distribution change, which is used to solve a vector e with a Hamming weight equal to ω so that it satisfies He=s, where H is a parity check matrix and s is a syndrome. The device includes:
[0085] The problem conversion module is used to transform H into Convert the syndrome s to s = (s1, s2), only consider the operation of the upper half of the matrix, and convert the problem of solving e to solving a vector e1 with a vector length of k and a Hamming weight of p, and make e1 satisfy H1e1 = s1, where p < ω;
[0086] The vector solving module is used to solve the vector e1 by using the pre-calculation method with adjustable Hamming weight, and substitute it into H2e1+e2=s2 to calculate e2, and verify whether e=e1+e2 satisfies wt(e)=ω.
[0087] In the information set decoding algorithm, a larger set size means a higher algorithm complexity. The present invention uses the idea of pre-computation decoding to avoid the increase in complexity in actual operations. When an example of a syndrome decoding problem is given, the codeword, that is, H, generally does not change, but the syndrome does change. Therefore, when the syndrome is not given, the present invention first performs some pre-computation on the codeword. When the syndrome is given, only the remaining steps need to be calculated online to obtain an online calculation time complexity lower than that of the general syndrome decoding problem. In the pre-computation stage, since it is an offline operation, what is often concerned is the storage complexity rather than the time complexity; in the online calculation stage, both complexities need to be concerned.
[0088] At this point, the problem becomes analyzing which parts can be pre-calculated and the resulting time complexity optimization. After analysis, it is found that the set L1, L2, L3, L4, L 11 The construction of all sets does not require the verification of sub-instances s, which means that when constructing these sets, pre-calculation can be adopted. And according to the previous analysis, the time-consuming calculation steps of the sets with larger weights can be completed in the pre-calculation step, which means that only the calculations of the sets with smaller weights need to be calculated in the online calculation step. Specifically, the present invention constructs sets L1, L2, L3, L4 in the pre-calculation stage and calculates the corresponding sets L 11 , when an instance s of the check subproblem is given, calculate the set L 12 , L 21 The present invention solves the element e1 in this way. This has the advantage of reducing the time complexity of the solution, and the size of the pre-calculated set can be adjusted by changing the parameter α. This variable feature enables it to be flexibly applied to different parameter settings and scenarios.
[0089] The present invention is an information set decoding algorithm for the syndrome decoding problem. In view of the equal weight characteristic of the previous information set decoding algorithm, an idea of unequal weights is proposed. And the part with high computational complexity is calculated by the pre-computation step, and the content calculated by the online calculation step is less than the content required by the original algorithm. In the pre-computation algorithm, the pre-computation step can be performed before the formal calculation, or it can be amortized to the calculation of each instance, so the complexity of the pre-computation stage is generally not estimated. Through this idea of the present invention, the complexity of the online stage is lower than the complexity of the original algorithm. Taking the specific parameters as an example, when α=0.9, when the storage complexity is 2 0.065n In the case of 0.046n, which is lower than the complexity of the original algorithm by 2 0.056n It can be seen that the method of the present invention has effectively optimized the exponent of time complexity.
[0090] An embodiment of the present invention provides a computer device, including a processor, a memory and a bus, wherein the memory stores machine-readable instructions executable by the processor. When the device is running, the processor communicates with the memory through the bus, and the processor executes the machine-readable instructions to perform any steps of the above-mentioned method for decoding an information set based on a change in weight distribution.
[0091] Specifically, the above-mentioned memory and processor can be general-purpose memory and processor, which are not specifically limited here. When the processor runs the computer program stored in the memory, it can execute the above-mentioned method of decoding the information set based on the change of weight distribution.
[0092] Those skilled in the art will appreciate that the structure of the computer device does not constitute a limitation on the computer device, and may include more or fewer components than shown in the figure, or combine certain components, or split certain components, or arrange the components differently.
[0093] In some embodiments, the computer device may also include a touch screen that can be used to display a graphical user interface (e.g., a startup interface of an application) and receive user operations on the graphical user interface (e.g., startup operations on an application). The specific touch screen may include a display panel and a touch panel. The display panel may be configured in the form of LCD (Liquid Crystal Display), OLED (Organic Light-Emitting Diode), etc. The touch panel may collect the user's contact or non-contact operations on or near it, and generate pre-set operation instructions, for example, the user uses any suitable object or accessory such as a finger, stylus, etc. on the touch panel or near the touch panel. In addition, the touch panel may include two parts: a touch detection device and a touch controller. Among them, the touch detection device detects the user's touch position and posture, detects the signal brought by the touch operation, and transmits the signal to the touch controller; the touch controller receives the touch information from the touch detection device, converts it into information that the processor can process, and then sends it to the processor, and can receive and execute commands sent by the processor. In addition, the touch panel can be implemented by various types such as resistive, capacitive, infrared and surface acoustic wave, and any technology developed in the future can also be used to implement the touch panel. Further, the touch panel can cover the display panel, and the user can operate on or near the touch panel covered on the display panel according to the graphical user interface displayed on the display panel. After the touch panel detects the operation on or near it, it is transmitted to the processor to determine the user input, and then the processor provides corresponding visual output on the display panel in response to the user input. In addition, the touch panel and the display panel can be implemented as two independent components or integrated.
[0094] Corresponding to the method for starting the above-mentioned application, an embodiment of the present invention further provides a storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps of the method for decoding any information set based on changes in weight distribution are executed.
[0095] The application startup device provided in the embodiment of the present application can be specific hardware on the device or software or firmware installed on the device. The device provided in the embodiment of the present application, its implementation principle and the technical effect produced are the same as those in the aforementioned method embodiment. For the sake of brief description, the parts not mentioned in the device embodiment can refer to the corresponding contents in the aforementioned method embodiment. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working processes of the systems, devices and units described above can all refer to the corresponding processes in the aforementioned method embodiment, and will not be repeated here.
[0096] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0097] In the embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of modules is only a logical function division. There may be other division methods in actual implementation. For example, multiple modules or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interfaces, indirect coupling or communication connection of devices or modules, which can be electrical, mechanical or other forms.
[0098] The modules described as separate components may or may not be physically separated, and the components shown as modules may or may not be physical modules, that is, they may be located in one place or distributed on multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0099] In addition, each functional module in the embodiments provided in the present application may be integrated into one processing module, or each module may exist physically separately, or two or more modules may be integrated into one module.
[0100] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0101] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0102] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0103] Finally, it should be noted that 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 above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.
Claims
1. A method for decoding information sets based on weight distribution changes, for solving a vector e with a Hamming weight equal to ω so that it satisfies He=s, where H is a parity check matrix, s is a syndrome, It is characterized in that The method comprises the following steps: H is transformed into Convert the syndrome s to s = (s 1 ,s 2 ), only considering the operation of the upper half of the matrix, the problem of solving e is converted into solving the vector e with a vector length of k and a Hamming weight of p 1 , and make e 1 Satisfy H 1 e 1 =s 1 , where p<ω; Solve the vector e using a pre-calculation method with adjustable Hamming weight 1 , and substitute into H 2 e 1 +e 2 =s 2 Calculate e 2 , and verify that e = e 1 +e 2 Whether wt(e)=ω is satisfied; The pre-calculation method using adjustable Hamming weight solves the vector e 1 ,include: Construct four benchmark lists L 1 , L 2 , L 3 , L 4 , where list L i The element is H 1 x i , i=1,2,3,4; x i Defined as: in, The length is Weight The set of all vectors of , α is an adjustable parameter, and Indicates that the value of its parameter is determined by the expression following it; Construct two lists L 11 and L 12 , and based on L 11 and L 12 Construct set L 21 , so that L 21 Medium element e 1 ′ satisfies wt(e 1 ′)=p, and we get the vector e 1 =e 1 ′; The list L 11 and L 12 They are: L 11 ={x 11 =(x 1 +x 2 )|H 1 x 1 +H 1 x 2 =t} L 12 ={x 12 =(x 3 +x 4 )|H 1 x 3 +H 1 x 4 +s=t} Where t is the length of A random vector of The L-based 11 and L 12 Construct set L 21 The process is: from the list L 11 and L 12 Select the one that satisfies wt(x 11 +x 12 )=p's element x 11 and x 12 , and record the selected element in the set as e 1 ′, then e 1 ′ is the element e 1 The solution.
2. The method for decoding information sets based on weight distribution change according to claim 1, It is characterized in that Adjustable parameters When x i The definition is as follows: Among them, w belongs to the length The vector weight is The set of all vectors .
3. The method for decoding information sets based on weight distribution change according to claim 2, It is characterized in that Adjustable parameters When the list L 1 and L 3 Yes H 1 and all the lengths k and the weight of the first half is The set of products of vectors whose second half is all 0, list L 2 and L 4 H 1 With all length k, and the weight of the first half is all 0, and the second half is The set consisting of the products of the vectors .
4. The method for decoding information sets based on weight distribution change according to claim 2, It is characterized in that Adjustable parameters When the list L 11 and L 12 Element x 11 and x 12 All have length k and weight vector, and the list L 11 and L 12 Elements and H 1 Multiplication and addition equals s 1 .
5. A device for decoding information sets based on weight distribution change, for solving a vector e with a Hamming weight equal to ω so that it satisfies He=s, where H is a parity check matrix, s is a syndrome, It is characterized in that The device comprises: The problem conversion module is used to transform H into Convert the syndrome s to s = (s 1 ,s 2 ), only considering the operation of the upper half of the matrix, the problem of solving e is converted into solving the vector e with a vector length of k and a Hamming weight of p 1 , and make e 1 Satisfy H 1 e 1 =s 1 , where p<ω; Vector solver module for solving vector e using a pre-calculation method with adjustable Hamming weight 1 , and substitute into H 2 e 1 +e 2 =s 2 Calculate e 2 , and verify that e = e 1 +e 2 Whether wt(e)=ω is satisfied; The pre-calculation method using adjustable Hamming weight solves the vector e 1 ,include: Construct four benchmark lists L 1 , L 2 , L 3 , L 4 , where list L i The element is H 1 x i , i=1,2,3,4; x i Defined as: in, The length is Weight The set of all vectors of , α is an adjustable parameter, and Indicates that the value of its parameter is determined by the expression following it; Construct two lists L 11 and L 12 , and based on L 11 and L 12 Construct set L 21 , so that L 21 Medium element e 1 ′ satisfies wt(e 1 ′)=p, and we get the vector e 1 =e 1 ′; The list L 11 and L 12 They are: L 11 ={x 11 =(x 1 +x 2 )|H 1 x 1 +H 1 x 2 =t} L 12 ={x 12 =(x 3 +x 4 )|H 1 x 3 +H 1 x 4 +s=t} Where t is the length of A random vector of The L-based 11 and L 12 Construct set L 21 The process is: from the list L 11 and L 12 Select the one that satisfies wt(x 11 +x 12 )=p's element x 11 and x 12 , and record the selected element in the set as e 1 ′, then e 1 ′ is the element e 1 The solution.
6. A computer device, It is characterized in that It includes a processor, a memory and a bus, the memory stores machine-readable instructions executable by the processor, when the computer device is running, the processor and the memory communicate through the bus, and the processor executes the machine-readable instructions to perform the steps of the method for decoding an information set based on a change in weight distribution as described in any one of claims 1-4.
7. A storage medium, It is characterized in that The storage medium stores a computer program, which, when executed by a processor, executes the steps of the method for decoding an information set based on a change in weight distribution as claimed in any one of claims 1 to 4.
Citation Information
Patent Citations
Decoding method, decoder and receiving machine
CN105634657A
Decoding method and system with precomputation
CN115225206A
Non-binary LDPC code symbol flipping decoding method based on momentum
CN115801023A
Information vector coding device, information vector decoding device, information vector coding method, information vector decoding method and program
JP2012247575A
"channel encoding method and a channel encoder"
WO2021226665A1
