No abstract

With the construction and improvement of 5G infrastructure, more devices choose to access the Internet to achieve some functions. People are paying more attention to information security in the use of network devices. This makes lightweight block ciphers become a hotspot. A lightweight block cipher with superior performance can ensure the security of information while reducing the consumption of device resources. Traditional optimization tools, such as brute force or random search, are often used to solve the design of Symmetric-Key primitives. The metaheuristic algorithm was first used to solve the design of Symmetric-Key primitives of SKINNY. The genetic algorithm and the simulated annealing algorithm are used to increase the number of active S-boxes in SKINNY, thus improving the security of SKINNY. Based on this, to improve search efficiency and optimize search results, we design a novel metaheuristic algorithm, named particle swarm-like normal optimization algorithm (PSNO) to design the Symmetric-Key primitives of SKINNY. With our algorithm, one or better algorithm components can be obtained more quickly. The results in the experiments show that our search results are better than those of the genetic algorithm and the simulated annealing algorithm. The search efficiency is significantly improved. The algorithm we proposed can be generalized to the design of Symmetric-Key primitives of other lightweight block ciphers with clear evaluation indicators, where the corresponding indicators can be used as the objective functions.

This method describes a new technology for combinatorial logic optimization in detail, which can combine multiple criteria to reduce the hardware implementation area of the S-box. This technique can be achieved in two steps. The first is to optimize the non-linear part of the S-box. According to the optimization criterion of multiplication complexity, the quality of the S-box nonlinear part optimization can be judged, and the realization of the S-box with the smallest multiplication complexity can be obtained. The second step is to optimize the linear part of the S-box, and optimize on the basis of the results of the first step, focusing on reducing the number of XOR gates, and the optimization is performed through a heuristic-based algorithm. The above combinatorial logic optimization technology can be applied to any small S-box (5 × 5 and below). Finally, the S-box of PRESENT algorithm and CTC2 algorithm are used as examples to illustrate the optimization effect, and the optimal realization under the minimum AND gate condition is obtained.