The key-scheduling algorithm in the AES is the component responsible for selecting from the master key the sequence of round keys to be xor-ed to the partially encrypted state at each iteration. We consider here the group Γ generated by the action of the AES-128 key-scheduling operation, and we prove that the smallest group containing Γ and all the translations of the message space is primitive. As a consequence, we obtain that no linear partition of the message space can be invariant under its action.

On the primitivity of the AES-128 key-schedule

Riccardo Aragona
;
Roberto Civino;Francesca Dalla Volta
2022

Abstract

The key-scheduling algorithm in the AES is the component responsible for selecting from the master key the sequence of round keys to be xor-ed to the partially encrypted state at each iteration. We consider here the group Γ generated by the action of the AES-128 key-scheduling operation, and we prove that the smallest group containing Γ and all the translations of the message space is primitive. As a consequence, we obtain that no linear partition of the message space can be invariant under its action.
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: https://hdl.handle.net/11697/193019
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact