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

From MaRDI portal
Publication:735032




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.





Describes a project that uses

Uses Software





This page was built for publication: An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735032)