Minimal consistent systems of local probabilistic relations for AES-like ciphers
Matematičeskie voprosy kriptografii, Tome 9 (2018) no. 3, pp. 127-142
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
In terms of graph-theoretical model we give a complete description of consistent systems of linear (differential) probabilistic relations with minimum number of active S-boxes for AES-like cipher with arbitrary number of rounds, uniformly diffusive permutations and fixed linear (differential) branch numbers of local matrices.
[1] Fedchenko V. A., “Pokazateli rasseivaniya lineinoi sredy AES-podobnykh algoritmov shifrovaniya”, Matematicheskie voprosy kriptografii, 8:3 (2017), 109–126 | DOI
[2] Malyshev F. M., Trifonov D. I., “Rasseivayuschie svoistva XSLP-shifrov”, Matematicheskie voprosy kriptografii, 7:3 (2016), 47–60 | DOI
[3] Erokhin A. V., Malyshev F. M., Trishin A. E., “Mnogomernyi lineinyi metod i pokazateli rasseivaniya lineinoi sredy shifrpreobrazovanii”, Matematicheskie voprosy kriptografii, 8:4 (2017), 29–62 | DOI
[4] Kholl M., Kombinatorika, Mir, M., 1970, 424 pp.