An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher

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.

arXiv comment10 pages: several improvements in exposition and content, including ruling out the symmetric group 9 pages; several changes in layout and exposition