Annali di Matematica Pura ed Applicata (1923 -)

, Volume 196, Issue 1, pp 1–17

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


DOI: 10.1007/s10231-016-0559-6

Cite this article as:
Aragona, R., Caranti, A. & Sala, M. Annali di Matematica (2017) 196: 1. doi:10.1007/s10231-016-0559-6


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.


Cryptosystems Feistel networks GOST round functions primitive groups wreath products 

Mathematics Subject Classification

20B15 20B35 94A60 

Copyright information

© Fondazione Annali di Matematica Pura ed Applicata and Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Dipartimento di MatematicaUniversità degli Studi di TrentoTrentoItaly