ALGORITHM FOR GENERATION OF S-BOX USING TRIGONOMETRIC TRANSFORMATION IN GENETIC ALGORITHM PARAMETERS

This article presents a fairly reliable algorithm for generating an S-box using a trigonometric function in the parameters of the genetic algorithm. S-boxes are essential components of modern cryptography and are used for permutation operations in various block cipher algorithms. The efficiency of the algorithm was demonstrated by various experimental experiments, which showed that the created S-box is sufficiently resistant to linear and differential cryptanalysis attacks. During the experimental analysis, the proposed S-box showed good results in various criteria, where the average level of nonlinearity was 105, the criterion of strict avalanche efficiency was 0.4941, the probability of linear convergence was 0.1328, and the probability of differential convergence was 10/256. Based on the obtained results, the effectiveness of the algorithm shows that the S-box is sufficiently stable for linear and differential cryptanalysis, which is illustrated by tables and graphs. It is worth noting that experimental experiments make it possible to create S-boxes with excellent cryptographic properties of this algorithm, such as high nonlinearity and differential probability of convergence and a fairly linear probability of convergence. Future improvements to this algorithm may make it applicable to various block ciphers and greatly improve the security of block ciphers.