Cryptographically Properties of Random S-Boxes
K. E. Lisitskiy, Ірина Вікторівна Лисицька, Alexandr Alexandrovich Kuznetsov · 2020
The results of studies of the properties of random permutations car- ried out with the participation of the authors are generalized. It is shown that random substitutions overwhelmingly have good cryptographic, and in particu- lar, algebraic properties. The prospects of using random S-blocks to build block symmetric ciphers with improved dynamic rates of arrival to random substitu- tion are substantiated. A refined model of random substitution and the corre- sponding criteria are proposed, with the help of which one can verify the suita- bility of substitutions generated randomly for use in modern cipher designs. It is a check, since with a very high probability the checked substitutions will be suitable.