An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
classification
🧮 math.GR
cs.ITmath.IT
keywords
groupaes-likecipherfunctionsgeneratedprimitiveroundalternating
read the original abstract
In a previous paper, we had proved that the permutation group generated by the round functions of an AES-like cipher is primitive. Here we apply the O'Nan Scott classification of primitive groups to prove that this group is the alternating group.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.