The group generated by the round functions of a GOST-like cipher

Abstract

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.

20 pages. Fixed mistake with parity of permutations, shortened argument in final section

Cited by in corpus (6)

• Regular subgroups with large intersection
• On the primitivity of PRESENT and other lightweight ciphers
• On the primitivity of Lai-Massey schemes
• Lack of Unique Factorization as a Tool in Block Cipher Cryptanalysis
• A note on an infeasible linearization of some block ciphers
• Invariant Hopping Attacks on Block Ciphers