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

A. Caranti, Francesca Dalla Volta, Massimiliano Sala · arXiv (Cornell University) · 2008

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.

Read the paper · More papers on PaperTik