The group generated by the round functions of a GOST-like cipher
Group Theory
2017-02-02 v2
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.
Keywords
Cite
@article{arxiv.1507.03458,
title = {The group generated by the round functions of a GOST-like cipher},
author = {R. Aragona and A. Caranti and M. Sala},
journal= {arXiv preprint arXiv:1507.03458},
year = {2017}
}
Comments
20 pages. Fixed mistake with parity of permutations, shortened argument in final section