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

DOI10.1007/S10623-009-9283-1zbMATH Open1174.94011arXiv0812.1629OpenAlexW1585928130WikidataQ121447061 ScholiaQ121447061MaRDI QIDQ735032FDOQ735032


Authors: Francesca Dalla Volta, Massimiliano Sala, Andrea Caranti Edit this on Wikidata


Publication date: 14 October 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0812.1629




Recommendations




Cites Work


Cited In (18)

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)