Doubly transitive XLS-families of permutations
Matematičeskie voprosy kriptografii, Tome 1 (2010) no. 2, pp. 93-103
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Conditions of $2$-transitivity for some sets of permutations are established. These sets of permutations are similar to some mappings used in modern block ciphers.
[1] Shafarevich I. R., Osnovy algebraicheskoi geometrii, v. 1, 2, Nauka, M., 1988 | MR
[2] Zenzin O. S., Ivanov M. A., Standart kriptograficheskoi zaschity AES. Konechnye polya, KUDITs-OBRAZ, M., 2002, 176 pp.
[3] Mak-Vilyams F. Dzh., Sloen N. Dzh. A., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979
[4] Proskuryakov I. V., Sbornik zadach po lineinoi algebre, Nauka, M., 1978
[5] Glukhov M. M., “O matritse chastot perekhodov par blokov v odnoi modifikatsii kriptoskhemy Rijndael”, Obozrenie prikl. i promyshl. matem., 11:2 (2004), 318–319