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. © 2009 Springer Science+Business Media, LLC.

Caranti, A., DALLA VOLTA, F., & Sala, M. (2009). An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher. DESIGNS, CODES AND CRYPTOGRAPHY, 52(3), 293-301 [10.1007/s10623-009-9283-1].

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

DALLA VOLTA, FRANCESCA;
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 that this group is the alternating group. © 2009 Springer Science+Business Media, LLC.
Articolo in rivista - Articolo scientifico
Cryptosystem, Rijandael, AES, Groups generated by round functions, Primitive groups, O'Nan-Scott, Wreath product, Affine groups
English
Caranti, A., DALLA VOLTA, F., & Sala, M. (2009). An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher. DESIGNS, CODES AND CRYPTOGRAPHY, 52(3), 293-301 [10.1007/s10623-009-9283-1].
Caranti, A; DALLA VOLTA, F; Sala, M
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/10281/6059
Citazioni
  • Scopus 17
  • ???jsp.display-item.citation.isi??? 16
Social impact