2000 character limit reached
An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
Published 9 Dec 2008 in math.GR, cs.IT, and math.IT | (0812.1629v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
