The group generated by the round functions of a GOST-like cipher
- 174 Downloads
We define a cipher that is an extension of GOST, and study the permutation group generated by its round functions. We show that, under minimal assumptions on the components of the cipher, this group is the alternating group on the plaintext space. This we do by first showing that the group is primitive, and then applying the O’Nan-Scott classification of primitive groups.
KeywordsCryptosystems Feistel networks GOST round functions primitive groups wreath products
Mathematics Subject Classification20B15 20B35 94A60
The authors are grateful to the referee for her suggestions. The authors are indebted to Rüdiger Sparr and Ralph Wernsdorf for reading a previous version and suggesting several changes, pointing out in particular a serious oversight on our part regarding the parity of permutations and providing a shorter argument for Sect. 5.3.
- 5.Dolmatov, V.: GOST 28147–89: encryption, decryption, and message authentication code (MAC) algorithms. Technical report (2010). http://tools.ietf.org/html/rfc5830
- 13.Oliynykov, R.: Cryptanalysis of symmetric block ciphers based on the Feistel network with non-bijective S-boxes in the round function. Cryptology ePrint Archive, Report 2011/685 (2011). https://eprint.iacr.org/2011/685
- 18.Wernsdorf, R.: The one-round functions of the DES generate the alternating group, Advances in cryptology–EUROCRYPT ’92 (Balatonfüred: Lecture Notes in Computer Science, vol. 658. Springer, Berlin (1992)Google Scholar