Geodesic
Diffusion rates of linear medium in AES-like ciphers
Matematičeskie voprosy kriptografii, Tome 8 (2017) no. 3, pp. 109-126 
V. A. Fedchenko. Diffusion rates of linear medium in AES-like ciphers. Matematičeskie voprosy kriptografii, Tome 8 (2017) no. 3, pp. 109-126. http://geodesic.mathdoc.fr/item/MVK_2017_8_3_a4/
@article{MVK_2017_8_3_a4,
     author = {V. A. Fedchenko},
     title = {Diffusion rates of linear medium in {AES-like} ciphers},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {109--126},
     year = {2017},
     volume = {8},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2017_8_3_a4/}
}
TY  - JOUR
AU  - V. A. Fedchenko
TI  - Diffusion rates of linear medium in AES-like ciphers
JO  - Matematičeskie voprosy kriptografii
PY  - 2017
SP  - 109
EP  - 126
VL  - 8
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MVK_2017_8_3_a4/
LA  - ru
ID  - MVK_2017_8_3_a4
ER  - 
%0 Journal Article
%A V. A. Fedchenko
%T Diffusion rates of linear medium in AES-like ciphers
%J Matematičeskie voprosy kriptografii
%D 2017
%P 109-126
%V 8
%N 3
%U http://geodesic.mathdoc.fr/item/MVK_2017_8_3_a4/
%G ru
%F MVK_2017_8_3_a4

Voir la notice de l'article provenant de la source Math-Net.Ru

We model AES-like algorithms by XSLP-ciphers having uniformly diffusive permutations $P$ and fixed linear (differential) branch number $\rho$ of blocks of transformation matrices $L$. For all admissible values of $\rho$ and arbitrary number of rounds the exact lower bound for the number of active $\mathrm{S}$-boxes in systems of linear (differential) probabilistic relations is obtained.

[1] Malyshev F. M., “Dvoistvennost raznostnogo i lineinogo metodov v kriptografii”, Matematicheskie voprosy kriptografii, 5:3 (2014), 35–47

[2] Malyshev F. M., Trifonov D. I., “Rasseivayuschie svoistva XSLP-shifrov”, Matematicheskie voprosy kriptografii, 7:3 (2016), 47–60

[3] Barreto P. S. L. M., Rijmen V., “The Anubis Block Cipher”, NESSIE, 2000 (to appear)

[4] Biryukov A., Nikolic I., “Automatic search for related-key differential characteristics in byteoriented block ciphers: applications to AES, Camellia, Khazad and others”, Lect. Notes Comput. Sci., 6110, 2010, 322–344 | DOI | MR | Zbl

[5] Borst J., “The Block Cipher: GrandCru”, NESSIE, 2000 (to appear)

[6] Daemen J., Knudsen L., Rijmen V., “The Block Cipher Square”, Lect. Notes Comput. Sci., 1267, 1997, 149–165 | DOI

[7] Daemen J., Rijmen V., “The Block Cipher BKSQ”, Lect. Notes Comput. Sci., 1820, 2000, 236–245 | DOI

[8] Daemen J., Rijmen V., The Design of Rijndael: AES — The Advanced Encryption Standard, Springer, Heidelberg etc., 2002, 238 pp. | MR | Zbl

[9] Fouque P.-A., Jean J., Peyrin T., “Structural evaluation of AES and chosen-key distinguisher of 9-round AES-128”, Lect. Notes Comput. Sci., 8042, 2013, 183–203 | DOI | Zbl

[10] Lim C., “A revised version of Crypton: Crypton v1.0”, Lect. Notes Comput. Sci., 1636, 1999, 31–45 | DOI | Zbl

[11] Mouha N., Wang Q., Gu D., Preneel B., “Differential and linear cryptanalysis using mixedinteger linear programming”, Lect. Notes Comput. Sci., 7537, 2012, 57–76 | DOI | Zbl