Integral Distinguisher Search of SLIM Algorithm Based on Bit-Based Division Property

The SLIM algorithm is a block cipher algorithm proposed in recent years and used in the Internet of Things system, which can ensure the security of information transmission in network devices. To evaluate the ability of the ultra-lightweight block cipher algorithm SLIM to resist integral analysis, the bit propagation trajectory of the SLIM algorithm is characterized by using the theory based on the division property of bits and combined with mixed-integer linear programming (MILP). We have modeled the propagation of division property and called the Gurobi solver to search for the integral distinguisher of the SLIM algorithm. Experiments show that there are 9 rounds of integral distinguisher in the SLIM algorithm, which is the longest integral distinguisher searched by the algorithm at present, and a large number of 8-round integral distinguisher of the SLIM algorithm are found, which contain a large number of balanced bits.