An upper bound evaluation method for the algebraic degree of a cryptographic permutation
By using a mixed-integer linear programming method, an upper bound model of the algebraic degree is constructed and solved, which solves the problem of estimating the upper bound of the algebraic degree of the substitution-permutation network algorithm in the existing technology, and realizes more accurate security analysis.
Patent Information
- Application Number
- CN202311495657.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-11-10
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2043-11-10
AI Technical Summary
Existing technologies struggle to effectively estimate the upper bound of the algebraic order of substitution-permutation network algorithms, impacting the security analysis of high-order differential attacks.
A mixed-integer linear programming approach is adopted to solve the upper bound of the algebraic degree of the cryptographic substitution algorithm by constructing an auxiliary set and a model of the maximum number of related values. The process includes initializing the array, updating array elements, constructing the auxiliary set, establishing the mixed-integer linear programming model, and solving it.
It provides a more precise upper bound on the algebraic degree, improving the accuracy of algorithm safety analysis.
Smart Images

Figure CN117499020B_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of information security, and specifically relates to a method for efficiently calculating a tight upper bound on the algebraic degree of a cryptographic permutation. Background Technology
[0002] In recent years, several substitution-permutation network (SPN) algorithms with the following structures have been proposed in the field of symmetric cryptography: keyed permutation and unkeyed permutation. The state vectors of these algorithms are vector spaces. The elements in, where Represents a finite field with 2n elements, n≥3 and m≥1. The round function for keyed cryptographic permutations (e.g.) Figure 1 (As shown) includes the following four operations:
[0003] (1) S-box layer: An invertible S-box acts in parallel on each component of the state vector. The S-box is formed by a power function. (where d≥1) and a Linearized affine polynomial on (where for 1≤w≤W, c) w The composite composition of ≠0).
[0004] (2) Linear layer: an invertible matrix It is applied to the state vector.
[0005] (3) Key addition: The round key is added to the state vector.
[0006] (4) Constant addition: The wheel constant is added to the state vector.
[0007] In addition, by setting all round keys of the above algorithm to zero vectors This allows us to obtain cryptographic permutations without a key.
[0008] To analyze the security of the algorithm, effectively estimating the upper bound of the algebraic degree is a crucial step in implementing high-order differential attacks. Specifically, the following problem needs to be considered: For an R-round algorithm with the above structure, let each component of its input state be of the following form: x i =λ i,1 ·x+λ i,0 , where λ i,0 , λ i,1 For a finite field In the algorithm, x is a constant and x is a variable. Each component of the algorithm's output state can be represented as a polynomial in x. We need to estimate the upper bound of the algebraic degree of this polynomial. However, how to effectively obtain its tight upper bound of algebraic degree has become a technical problem that needs to be solved. Summary of the Invention
[0009] The purpose of this invention is to provide a method for evaluating the upper bound of the algebraic degree of a cryptographic permutation, which is aimed at the R (R≥2) round algorithm with the above structure (where W>1) and the above-mentioned upper bound problem of algebraic degree. This method can effectively obtain a tighter upper bound of the algebraic degree and has strong practicality.
[0010] The technical solution of this invention is as follows:
[0011] A method for evaluating the upper bound of the algebraic degree of a cryptographic permutation, comprising the following steps:
[0012] 1) For a finite field Based on the structure of the cryptographic substitution algorithm, obtain the relevant parameters (n, d, R, h1, h2, ..., h) of the algorithm. w Then calculate the auxiliary set. Where R is the number of rounds in the cryptographic permutation algorithm, and the S-box of the cryptographic permutation algorithm is determined by an exponential function. With one Linearized affine polynomial on The structure is as follows: for 1 ≤ w ≤ W, cw ≠ 0; d is the defined value of the S-box power function, h w Define a vector component for the w-th affine polynomial of the S-box, where n is the length of the state vector component x.
[0013] 2) Let p = 1, q = 1, initialize the upper bound of the algebraic degree U = 0; create 2R one-dimensional arrays A1, ..., An of size n. R B1, ..., B R And initialize its elements to 0;
[0014] 3) Solve for the upper bound U of the cryptographic permutation algorithm according to steps 31) to 35);
[0015] 31) Update arrays A1, ..., A R Elements in: For each array A r And for each t′∈[0, n-1], calculate j=((R-r+1)d+h p If the condition t′∈T holds, then let A +t′)mod n. r [j] = 1, otherwise let A r [j] = 0; for each array A r Create an auxiliary set The elements contained therein are intermediate parameters related to the exponents of the monomials that may appear in the output state polynomial of the cryptographic permutation algorithm; A r [j] = 1 means that j is a set. Possible values for parameter A r [j] = 0 means that j is not a set. Possible values for the parameter; where 1 ≤ r ≤ R, h p Define vector components for the p-th affine polynomial of the S-box;
[0016] 32) Update arrays B1, ..., B R Elements in: For each array B r And for each t′∈[0, n-1], calculate j=((Rr)d+h q If the condition t′∈T holds, then let B = +t′)mod n. r [j] = 1, otherwise let B r [j] = 0; for each array B r Create an auxiliary set The elements contained therein are intermediate parameters related to the exponents of the monomials that may appear in the output state polynomial of the cryptographic permutation algorithm; B r [j] = 1 means that j is a set. Possible values for the parameter B r [j] = 0 means that j is not a set. Possible values for the parameter: 1 ≤ r ≤ R, h q Define vector components for the q-th affine polynomial of the S-box; then construct an auxiliary set. initialization For each j∈[0, n-1], if there exists r∈[1, R] such that A r [j]+B r If [j] > 0 is true, then let Z p,q =Z p,q ∪{j); For auxiliary set Z p,q |Zth in ascending order p,q | elements;
[0017] 33) Establish a mixed-integer linear programming model with the maximum number of relevant values. Solve for it, and denote the obtained solution as π. p,q ;
[0018] 34) Solve Let the solution be φ. p,q Where Hw() is the Hamming weight function, for any v∈[1, |Z], ... p,q |], and functions Defined as If φ p,q >U, then let U=φ p,q ;
[0019] 35) Let q = q + 1; if q > W, then let p = p + 1; if p > W, then output U; otherwise let q = 1 and return to step 31); if q ≤ W, then return to step 32).
[0020] Furthermore, a mixed integer linear programming (MILP) model is established to determine the maximum number of values for the relevant quantities. The method is as follows:
[0021] (1) For each array A r Define 2n binary variables: For j∈[0, n-1], Representative j is A parameter value in a subset, Representative j is A parameter value in a subset; the binary variable satisfies the constraints a1)~d1):
[0022] a1) For any r∈[1,R] and any j∈[0,n-1], if A r [j] = 0, then
[0023] b1) For any r′∈[1, R-1] and any j∈[0, n-1], we have
[0024] c1) For any j∈[0, n-1], we have as well as
[0025] d1) For any r′∈[1,R-1], we have
[0026] (2) For each r∈[1,R], define 2n binary variables: For j∈[0, n-1], Representative j is A parameter value in a subset, Representative j is A parameter value in a subset; the binary variables satisfy the constraints a2)~d2):
[0027] a2) For any r∈[1,R] and any j∈[0,n-1], if B r [j] = 0, then
[0028] b2) For any r′∈[1, R-1] and any j∈[0, n-1], we have
[0029] c2) For any j∈[0, n-1], we have as well as
[0030] d2) For any r′∈[1,R-1], we have
[0031] (3) Define n binary variables: X0, ..., Xn n-1 For j∈[0, n-1], X j =1 means j is a set The parameter values in; variables X0, ..., X n-1 Satisfying constraints a3)~c3):
[0032] a3) For any j∈[0, n-1] and any r∈[1, R], we have
[0033] b3) For any j∈[0, n-1] and any r∈[1, R], we have
[0034] c3) For any j∈[0, n-1], we have
[0035] (4) Set the objective function as
[0036] Furthermore, a mixed-integer linear programming model with a monomial exponent Hamming weight upper bound is established. right Solve the problem to obtain the solution φ. p,q Establish the mixed-integer linear programming model with the monomial exponent Hamming weight upper bound. The method is as follows:
[0037] (1) Let
[0038] (2) Define the following binary variables:
[0039] ①
[0040] ②
[0041] ③
[0042] ④
[0043] ⑤
[0044] ⑥
[0045] (3) For any i1∈[0,k-1], j1∈[R+1,n-1], The following conditions must be met:
[0046] (4) For any j∈[0, n-1], sum 0,j Satisfy the constraint: sum 0,j =0;
[0047] (5) For any j′∈[0, len-1], suc 0,j′ Satisfy the constraint: suc 0,j′ =0;
[0048] (6) For any i1∈[0,k-1], let j2=2*i1, and add the following constraint:
[0049] ①
[0050] ②For any z∈[0, n-1],
[0051] ③
[0052] ④ For any z∈[0, n-1],
[0053] ⑤
[0054] ⑥ For any z′∈[0, R],
[0055] ⑦ For any z″∈[R+1, len-1],
[0056] (7) For any j3∈[R+1, len-1], add the following constraints:
[0057] (8) For any j4∈[0, R-1], add the following constraints:
[0058] (9) For any i1∈[0, k-1], add the following constraints: And for any j∈[0, n-1],
[0059] (10) Set restrictions:
[0060] (11) Set the objective function as
[0061] Furthermore, the exponents of the monomials that may appear in the algorithm's output state polynomial are in the following form:
[0062]
[0063] Where w′, w″∈[1,W], h w′ The S-box affine polynomial defines the vector (h1, h2, ..., h). W The w′th component of ) h w″ The S-box affine polynomial defines the vector (h1, h2, ..., h). W The w″-th component of ); for 1≤s≤2 R-1 K s , K′ s ∈[0,1], And for have parameter To output the state monomial exponent, define the vector component h. w′ The next A class-A related quantities, parameters To output the state monomial exponent, define the vector component h. w″ The next One Class B related quantity.
[0064] Furthermore, sets gather To output the state monomial exponent, define the vector component h. p The next A Class A related quantity, To output the state monomial exponent, define the vector component h. q The next One Class B related quantity.
[0065] Furthermore, Representative j is subset of One of the parameter values, Representative j is subset of One of the parameter values; Representative j is subset of One of the parameter values, Representative j is subset of One of the parameter values.
[0066] A server is characterized by comprising a memory and a processor, the memory storing a computer program configured to be executed by the processor, the computer program including instructions for performing the steps of the methods described above.
[0067] A computer-readable storage medium having a computer program stored thereon, characterized in that the computer program, when executed by a processor, implements the steps of the above-described method.
[0068] The advantages of this invention are as follows:
[0069] Compared to currently available methods for evaluating the upper bound of the algebraic degree of cryptographic permutations, this method can obtain a more accurate upper bound. Attached Figure Description
[0070] Figure 1 This is a schematic diagram of a round function for keyed cryptographic permutations.
[0071] Figure 2 This is a flowchart of the method of the present invention. Detailed Implementation
[0072] The present invention will now be described in further detail with reference to the accompanying drawings. The examples given are only for explaining the present invention and are not intended to limit the scope of the present invention.
[0073] The method flow of this invention is as follows: Figure 2 As shown, the specific steps are as follows (in the following text, the symbols [a, b] represent sets). in (Representing the set of natural numbers):
[0074] Preprocessing stage: First, based on the algorithm structure, obtain the relevant parameters of the algorithm: the length n of the state vector component x, the defined value d of the S-box power function, the number of rounds R, and the defined vectors of the S-box affine polynomials (h1, h2, ..., h...). W That is, the relevant parameters of the algorithm (n, d, R, h1, h2, ..., h) are obtained. W ), where the algorithm's operations are defined in a space of size 2. n Finite field (n≥3) Above, state vector components The number of rounds in the algorithm is R (R≥2), and the S-box of the algorithm is determined by an exponential function. With one Linearized affine polynomial over a finite field of size 2 (in Let W be the constant term of the polynomial A(x); W be the number of monomials in A(x) whose coefficients are not zero except for the constant term, 1 ≤ W ≤ n; for 1 ≤ w ≤ W, c w monomial The coefficient, 0≤h w A composite composition of ≤n-1).
[0075] Then calculate the auxiliary set. Where t is an intermediate parameter related to the exponent of the monomial that may appear in the state polynomial of the algorithm output, and the auxiliary set T contains all possible values of t mod n.
[0076] Initialization phase: Let p = 1, q = 1, and the upper bound of the candidate algebra degree U = 0. Let A1, ..., A R B1, ..., B R Both are one-dimensional arrays of size n, and their elements are initialized to 0; that is, for any r∈[1,R], And A r [j] = Br[j] = 0 for any j ∈ [0, n-1].
[0077] Solution phase:
[0078] Step 1. Update arrays A1, ..., A1 as follows: R Elements in: For r∈[1,R], for each t′∈[0,n-1], compute j=((R-r+1)d+h p If the condition t′∈T holds, then let A +t′)mod n. r [j] = 1, otherwise, let A r [j] = 0; h p The S-box affine polynomial defines the vector (h1, h2, ..., h). w The p-th component of ) h p The value range is [0, n-1]. Each array A r (1≤r≤R) and an auxiliary set correspond, The elements contained therein are intermediate parameters related to the exponents of the monomials that may appear in the algorithm's output state polynomial, i.e., the set. Among them, for To output the state monomial exponent, define the vector component h. p The next A Class A related quantity, express A r [j] = 1 means that j is a set. Possible values for parameter A r [j] = 0 means that j is not a set. Possible values for the parameter.
[0079] Step 2. First, update arrays B1, ..., B as follows: R Elements in: For r∈[1,R], for each t′∈[0,n-1], compute j=((Rr)d+h q If the condition t′∈T holds, then let B = +t′)mod n. r [j] = 1, otherwise, let B r [j] = 0; h q The S-box affine polynomial defines the vector (h1, h2, ..., h). w The q-th component of ) h q The value range is [0, n-1]. Each array B r (1≤r≤R) and an auxiliary set correspond, The elements contained therein are intermediate parameters related to the exponents of the monomials that may appear in the algorithm's output state polynomial, i.e., the set. Among them, for To output the state monomial exponent, define the vector component h. q The next A Class B related quantity, express B r [j] = 1 means that j is a set. Possible values for the parameter B r [j] = 0 means that j is not a set. Possible values for the parameter.
[0080] Then, construct the auxiliary set Z as follows: p,q :initialization For each j∈[0, n-1], if there exists r∈[1, R] such that A r [j]+B r If [j] > 0 is true, then let Z p,q =Z p,q ∪{j}. {j} contains only one element j. This represents the existence of r∈[1,R] such that j is Medium parameters or Possible values for the intermediate parameter. The final auxiliary set Z. p,q Recorded as Where 1≤v≤|Z p,q |,p v Represents set Zp,q The v-th element is the result of arranging all elements in ascending order.
[0081] Next, proceed to step 3.
[0082] Step 3. Define the vector component h based on the output state monomial exponent. p The constraints on the type A related quantities, and the output state monomial exponent in the definition of vector components h q The constraints of the B-type related quantities are applied to the output state monomial exponent in the defined vector component h. p The type A correlation quantity and the output state monomial exponent are defined in the vector component h. q The objective is to maximize the number of possible values for the Class B related quantities. A mixed-integer linear programming (MILP) model for "maximum number of related quantity values" is established as follows. And solve for (denoted as π). p,q ).
[0083] (1) For each r∈[1,R], define 2n binary variables: For j∈[0, n-1], Representative j is subset of The value of a certain parameter in the text. Representative j is subset of The value of a certain parameter in the binary variables. These binary variables satisfy the following constraints:
[0084] a) For any r∈[1, R] and any j∈[0, n-1], if A r If [j] = 0, then
[0085] b) For any r′∈[1, R-1] and any j∈[0, n-1], we have
[0086] c) For any j∈[0, n-1], we have as well as
[0087] d) For any r′∈[1, R-1], we have
[0088] (2) For each r∈[1,R], define 2n binary variables: For j∈[0, n-1], Representative j is subset of The value of a certain parameter in the text. Representative j is subset of The value of a certain parameter in the binary variables. These binary variables satisfy the following constraints:
[0089] a) For any r∈[1, R] and any j∈[0, n-1], if B r If [j] = 0, then
[0090] b) For any r′∈[1, R-1] and any j∈[0, n-1], we have
[0091] c) For any j∈[0, n-1], we have as well as
[0092] d) For any r′∈[1, R-1], we have
[0093] (3) Define n binary variables: X0, ..., Xn n-1 For j∈[0, n-1], X j =1 means j is a set The value of a certain parameter in the variable X0, ..., X... n-1 The following constraints must be met:
[0094] a) For any j∈[0, n-1] and any r∈[1, R], we have
[0095] b) For any j∈[0, n-1] and any r∈[1, R], we have
[0096] c) For any j∈[0, n-1], we have
[0097] (4) Set the objective function as
[0098] Then, using currently common solution methods to... By solving this problem, the objective function can be obtained. The value of π is used to find the solution, which is denoted as π. p,q .
[0099] Step 4. Solve the following optimization problem (denoted as φ). p,q ):
[0100]
[0101] Where Hw() is the Hamming weight function, that is, for a positive integer γ, Hw(γ) is the number of 1s in the binary representation of γ; for any v∈[1, |Z], ... p,q |], and functions Defined as
[0102]
[0103] 2 n -1|x represents 2 n -1 is divisible by x.
[0104] Specifically, based on the constraints of each parameter in the above optimization problem and the objective function of the optimization problem, the following mixed-integer linear programming (MILP) model with "monomial exponent Hamming weight upper bound" is established. And then solve it.
[0105] (1) Let
[0106] (2) Define the following binary variables:
[0107] ①
[0108] ②
[0109] ③
[0110] ④
[0111] ⑤
[0112] ⑥
[0113] (3) For any i1∈[0,k-1], j1∈[R+1,n-1], The following constraints must be met:
[0114] (4) For any j∈[0, n-1], sum 0,j The following constraints must be met: sum 0,j =0.
[0115] (5) For any j′∈[0, len-1], suc 0,j′ The following constraints must be met: suc 0,j′ =0.
[0116] (6) For any i1∈[0,k-1], let j2=2*i1, and add the following constraint:
[0117] ①
[0118] ②For any z∈[0, n-1],
[0119] ③
[0120] ④ For any z∈[0, n-1],
[0121] ⑤
[0122] ⑥ For any z′∈[0, R],
[0123] ⑦ For any z″∈[R+1, len-1],
[0124] (7) For any j3∈[R+1, len-1], add the following constraints:
[0125] (8) For any j4∈[0, R-1], add the following constraints:
[0126] (9) For any i1∈[0, k-1], add the following constraints: And for any j∈[0, n-1],
[0127] (10) Add restrictions:
[0128] (11) Set the objective function as
[0129] Then, a general solution method is used to... Solve the problem to obtain the solution φ. p,q .
[0130] If φ p,q >U, then let U = φ p,q .
[0131] Step 5. Let q = q + 1;
[0132] If q > W, then let p = p + 1; if p > W, then output U; otherwise, let q = 1 and return to step 1.
[0133] If q≤W, then return to step 2.
[0134] Although specific embodiments of the invention have been disclosed for illustrative purposes to aid in understanding and implementing the invention, those skilled in the art will understand that various substitutions, variations, and modifications are possible without departing from the spirit and scope of the invention and the appended claims. Therefore, the invention should not be limited to the content disclosed in the preferred embodiments, and the scope of protection claimed by the invention is defined by the claims.
Claims
1. A method for evaluating the upper bound of the algebraic degree of a cryptographic permutation, comprising the following steps: 1) For a finite field Based on the structure of the cryptographic substitution algorithm, obtain the relevant parameters (n, d, R, h1, h2, ..., h) of the cryptographic substitution algorithm. W Then calculate the auxiliary set. Where R is the number of rounds in the cryptographic permutation algorithm, and the S-box of the cryptographic permutation algorithm is determined by an exponential function. With one Linearized affine polynomial on The composition, for 1≤w≤W,c w ≠0; d is the defined value of the S-box power function, h w Define a vector component for the w-th affine polynomial of the S-box, where n is the length of the state vector component x. 2) Let p = 1, q = 1, initialize the upper bound of the algebraic degree U = 0; create 2R one-dimensional arrays A1, ..., An of size n. R ,B1,…,B R And initialize its elements to 0; 3) Solve for the upper bound U of the cryptographic permutation algorithm according to steps 31) to 35); 31) Update arrays A1,...,A R Elements in: For each array A r And for each t′∈[0,n-1], calculate j=((R-r+1)d+h p If the condition t′∈T holds, then let A +t′)mod n. r [j] = 1, otherwise let A r [j] = 0; for each array A r Create an auxiliary set The elements contained therein are intermediate parameters related to the exponents of the monomials that may appear in the output state polynomial of the cryptographic permutation algorithm; A r [j] = 1 means that j is a set. Possible values for parameter A r [j] = 0 means that j is not a set. Possible values for the parameter; where 1 ≤ r ≤ R, h p Define a vector for the p-th affine polynomial of the S-box; 32) Update arrays B1,…,B R Elements in: For each array B r And for each t′∈[0,n-1], calculate j=((Rr)d+h q If the condition t′∈T holds, then let B = +t′)mod n. r [j] = 1, otherwise let B r [j] = 0; for each array B r Create an auxiliary set The elements contained therein are intermediate parameters related to the exponents of the monomials that may appear in the output state polynomial of the cryptographic permutation algorithm; B r [j] = 1 means that j is a set. Possible values for the parameter B r [j] = 0 means that j is not a set. Possible values for the parameter: 1 ≤ r ≤ R, h q Define vector components for the q-th affine polynomial of the S-box; then construct an auxiliary set. initialization For each j∈[0,n-1], if there exists r∈[1,R] such that A r [j]+B r If [j]>0 is true, then let Z p,q =Z p,q ∪{j}; For auxiliary set Z p,q |Zth in ascending order p,q | elements; 33) Establish a mixed-integer linear programming model with the maximum number of relevant values. Solve for it, and denote the obtained solution as π. p,q ; 34) Solve Let the solution be φ. p,q Where Hw() is the Hamming weight function, for any v∈[1,|Z p,q |], |{p v |a pv ≠0}|≤π p,q and function M n (·): Defined as If φ p,q >U, then let U=φ p,q ; 35) Let q = q + 1; if q > W, then let p = p + 1; if p > W, then output U; otherwise, let q = 1 and return to step 31); if q ≤ W, then return to step 32).
2. The method according to claim 1, characterized in that, Establish a mixed integer linear programming (MILP) model with the maximum number of values for the relevant quantities. The method is as follows: (1) For each array A r Define 2n binary variables: For j∈[0,n-1], Representative j is A parameter value in a subset, Representative j is A parameter value in a subset; the binary variable satisfies the constraints a1)~d1): a1) For any r∈[1,R] and any j∈[0,n-1], if A r [j] = 0, then b1) For any r′∈[1,R-1] and any j∈[0,n-1], we have c1) For any j∈[0,n-1], we have as well as d1) For any r′∈[1,R-1], we have (2) For each r∈[1,R], define 2n binary variables: For j∈[0,n-1], Representative j is A parameter value in a subset, Representative j is A parameter value in a subset; the binary variables satisfy the constraints a2)~d2): a2) For any r∈[1,R] and any j∈[0,n-1], if B r [j] = 0, then b2) For any r′∈[1,R-1] and any j∈[0,n-1], we have c2) For any j∈[0,n-1], we have as well as d2) For any r′∈[1,R-1], we have (3) Define n binary variables: X0, ..., X n-1 For j∈[0,n-1], X j =1 means j is a set The parameter values in; variables X0,…,X n-1 Satisfying constraints a3)~c3): a3) For any j∈[0,n-1] and any r∈[1,R], we have b3) For any j∈[0,n-1] and any r∈[1,R], we have c3) For any j∈[0,n-1], we have (4) Set the objective function as 3. The method according to claim 2, characterized in that, By establishing a mixed-integer linear programming model with an upper bound on the monomial exponent Hamming weight. right Solve the problem to obtain the solution φ. p,q Establish the mixed-integer linear programming model with the monomial exponent Hamming weight upper bound. The method is as follows: (1) Let (2) Define the following binary variables: ① ② ③ ④ ⑤ ⑥ (3) For any i1∈[0,k-1], j1∈[R+1,n-1], The following conditions must be met: (4) For any j∈[0,n-1], sum 0,j Satisfy the constraint: sum 0,j =0; (5) For any j′∈[0,len-1], suc 0,j′ Satisfy the constraint: suc 0,j′ =0; (6) For any i1∈[0,k-1], let j2=2*i1, and add the following constraint: ① ②For any z∈[0,n-1], ③ ④ For any z∈[0,n-1], ⑤ ⑥ For any z′∈[0,R], ⑦ For any z″∈[R+1,len-1], (7) For any j3∈[R+1,len-1], add the following constraints: (8) For any j4∈[0,R-1], add the following constraints: (9) For any i1∈[0,k-1], add the following constraints: And for any j∈[0,n-1], (10) Set restrictions: (11) Set the objective function as 4. The method according to claim 1, 2, or 3, characterized in that, The exponents of possible monomials in the output state polynomial of the cryptographic permutation algorithm are: Where w′, w″∈[1,W], h w′ The S-box affine polynomial defines the vector (h1, h2, ..., h). W The w′th component of ) h w″ The S-box affine polynomial defines the vector (h1, h2, ..., h). W The w″-th component of ); for 1≤s≤2 R-1 K s ,K′ s ∈[0,1], And for have parameter To output the state monomial exponent, define the vector component h. w′ The next A class-A related quantities, parameters To output the state monomial exponent, define the vector component h. w″ The next One Class B related quantity.
5. The method according to claim 4, characterized in that, gather gather To output the state monomial exponent, define the vector component h. p The next A class-A related quantity, To output the state monomial exponent, define the vector component h. q The next One Class B related quantity.
6. The method according to claim 5, characterized in that, Representative j is subset of One of the parameter values, Representative j is subset of One of the parameter values; Representative j is subset of One of the parameter values, Representative j is subset of One of the parameter values.
7. A server, characterized in that, It includes a memory and a processor, the memory storing a computer program configured to be executed by the processor, the computer program including instructions for performing each step of the method of any one of claims 1 to 6.
8. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.
