Optimum algorithm of S-boxes based on fast convergence speed genetic algorithm
基于快速收敛遗传算法的S盒的优化算法

The optimization of S-boxes based on genetic algorithm was discussed, and the heuristic mutation strategy was used in this algorithm. Results of the experiments indicate that the mutation operation has high searching efficiency and fast convergence speed. Meanwhile, the selection strategy of preserving the best individuals can reduce the calculation time greatly. Based on the method, an effective genetic algorithm for 6×6 S-boxes was provided and a number of S-boxes with high nonlinearity and low difference uniformity were obtained.