On mixing linear transforms for block ciphers
Matematičeskie voprosy kriptografii, Tome 2 (2011) no. 2, pp. 5-39
Cet article a éte moissonné depuis la source Math-Net.Ru
We consider AES-type block ciphers over the finite field with linear mixing transforms of three classes: maximally mixing, block-uniform and composite. Transition probability matrices of pairs of input blocks for these schemes with random indepРμndent equiprobable round keys are investigated. A minimum number of rounds sufficient for the generation of doubly transitive set of permutations are found for schemes without mixing transforms in odd rounds.
@article{MVK_2011_2_2_a0,
author = {M. M. Gluhov},
title = {On mixing linear transforms for block ciphers},
journal = {Matemati\v{c}eskie voprosy kriptografii},
pages = {5--39},
year = {2011},
volume = {2},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MVK_2011_2_2_a0/}
}
M. M. Gluhov. On mixing linear transforms for block ciphers. Matematičeskie voprosy kriptografii, Tome 2 (2011) no. 2, pp. 5-39. http://geodesic.mathdoc.fr/item/MVK_2011_2_2_a0/
[1] Glukhov M. M., “O 2-tranzitivnykh proizvedeniyakh regulyarnykh grupp podstanovok”, Trudy po diskretnoi matematike, 3, M., 2000, 37–52
[2] Glukhov M. M., Elizarov V. P., Nechaev A. A., Algebra, v. II, Gelios-ARV, M., 2003
[3] Malyshev F. M., “Dvazhdy tranzitivnye XSL-semeistva podstanovok”, Matem. voprosy kriptografii, 1:2 (2010), 93–103
[4] Mak-Vilyams F. D., Sloen N. D. A., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979
[5] Sachkov V. N., Veroyatnostnye metody v kombinatornom analize, Nauka, M., 1978 | Zbl
[6] Daemen J., Rijmen V., “The Rijndael block cipher”, AES Proposal, 1998, 1–37
[7] Wielandt H., Finite permutation groups, Acad. Press, N.Y.–London, 1984