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 (0812.1629v4)
Published 9 Dec 2008 in math.GR, cs.IT, and math.IT
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.