Geodesic
The influence of linear mapping reducibility on the choice of round constants
Matematičeskie voprosy kriptografii, Tome 8 (2017) no. 2, pp. 51-64 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The influence of reducibility of linear mappings on the security of block ciphers is studied. It is shown that the replacement of only two key schedule constants of Khazad block cipher leads to the appearance of weak key classes. We study invariant subspaces of the Kuznyechik linear mapping and demonstrate that there are no weak key schedule constants similar to Khazad. But the choice of other linear mappings constructed similarly to the original Kuznyechik mapping and choice of other constants may results in the appearance of weak keys. 
@article{MVK_2017_8_2_a4,
     author = {D. A. Burov and B. A. Pogorelov},
     title = {The influence of linear mapping reducibility on the choice of round constants},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {51--64},
     year = {2017},
     volume = {8},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MVK_2017_8_2_a4/}
}
TY  - JOUR
AU  - D. A. Burov
AU  - B. A. Pogorelov
TI  - The influence of linear mapping reducibility on the choice of round constants
JO  - Matematičeskie voprosy kriptografii
PY  - 2017
SP  - 51
EP  - 64
VL  - 8
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MVK_2017_8_2_a4/
LA  - en
ID  - MVK_2017_8_2_a4
ER  - 
%0 Journal Article
%A D. A. Burov
%A B. A. Pogorelov
%T The influence of linear mapping reducibility on the choice of round constants
%J Matematičeskie voprosy kriptografii
%D 2017
%P 51-64
%V 8
%N 2
%U http://geodesic.mathdoc.fr/item/MVK_2017_8_2_a4/
%G en
%F MVK_2017_8_2_a4
D. A. Burov; B. A. Pogorelov. The influence of linear mapping reducibility on the choice of round constants. Matematičeskie voprosy kriptografii, Tome 8 (2017) no. 2, pp. 51-64. http://geodesic.mathdoc.fr/item/MVK_2017_8_2_a4/

[1] Barreto P., Rijmen V., “The Khazad Legacy-Level Block Cipher”, First Open NESSIE Workshop (2000), Submission to NESSIE

[2] Bulygin S., Walter M., Study of the invariant coset attack on PRINT cipher: more weak keys with practical key recovery, Cryptology ePrint Archive. Report 2012/085

[3] Burov D. A., Pogorelov B. A., “An attack on 6 rounds of Khazad”, Mathematical Aspects of Cryptography, 2:7 (2016), 35–46 | MR

[4] Daemen J., Cipher and hash function design strategies based on linear and differential cryptanalysis, K. U. Leuven, Leuven, Belgium, 1995, 252 pp.

[5] D.STVL.9. Ongoing Research Areas in Symmetric Cryptography, 2008 IST-2002-507932, ECRYPT. European Network of Excellence in Cryptology

[6] Guo J., Jean J., Nicolic I., Qiao K., Sasaki Y., Meng Sim S., Invariant subspace attack against full Midory64, Cryptology ePrint Archive. Report 2015/1189

[7] Leander G., Abdelraheem M., Alkhzaimi H., Zenner E., “A cryptanalysis of PRINT cipher: The invariant subspace attack”, CRYPTO'11, Lect. Notes Comput. Sci., 6841, 2011, 206–221 | DOI | MR | Zbl

[8] Leander G., Minaud B., Sonjom S., “A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro”, EUROCRYPT'15, Lect. Notes Comput. Sci., 9056, 2015, 254–283 | DOI | MR | Zbl

[9] Pogorelov B. A., Pudovkina M. A., “On the distance from permutations to imprimitive groups for a fixed system of imprimitivity”, Discrete Math. Appl., 24:2 (2014), 95–108 | DOI | MR | Zbl

[10] Pogorelov B. A., Pudovkina M. A., “Factor structures of transformations”, Mathematical Aspects of Cryptography, 3:3 (2012), 81–104 (in Russian)

[11] Pogorelov B. A., Pudovkina M. A., “Combinatorial characterization of XL-layers”, Mathematical Aspects of Cryptography, 4:3 (2013), 99–129 (in Russian) | MR

[12] Shishkin V., Dygin D., Lavrikov I., Marshalko G., Rudskoy V., Trifonov D., “On a new Russian Encryption Standard”, Mathematical Aspects of Cryptography, 6:2 (2015), 29–34 | MR