Research Article
Integral Distinguishers of the Full-Round Lightweight Block Cipher SAT_Jo
Algorithm 2
An automatic search of integral distinguishers for SAT_Jo algorithm.
| Input: MILP model consisting of linear inequalities and an objective function | | Output: balanced bit position of | (1) | Initialization | (2) | fordo | (3) | if has a feasible solution then | (4) | ifValue = 1 then// value after optimizing , it returns the current value of the objective function | (5) | Obj = obj. Objective ()//obj.Objective represents the objective function of the returned model | (6) | fordo | (7) | var = obj.getValue ()//Return the -th variable of the objective function | (8) | value = obj.getAttr ()//Get the var value of the current solution | (9) | if value = 1 then | (10) | delete/{var}in //Delete the var value in | (11) | M.addConstraint (var = 0) | (12) | M.update () | (13) | break | (14) | end if | (15) | end for | (16) | end if | (17) | end if | (18) | end for | (19) | return //Represent the S value of all outputs |
|