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 an alternative proof of the fact that this group is the alternating group.
An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
Caranti, Andrea;Sala, Massimiliano
2009
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 an alternative proof of the fact that this group is the alternating group.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
