On the primitivity of the AES-128 key-schedule

DOI10.1142/S021949882350233XMaRDI QIDQ6090967zbMATH OpenOpenAlexFDO

Authors Riccardo Aragona, Roberto Civino, Francesca Dalla Volta

Publication date 21 November 2023

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

cryptographyprimitive groupsAESkey schedulegroup generated by the round functionsinvariant partitions

Mathematics Subject Classification ID

Cryptography (94A60) Primitive groups (20B15) Subgroups of symmetric groups (20B35)

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 $Gamma$ generated by the action of the AES-128 key-scheduling operation, and we prove that the smallest group containing $Gamma$ and all the translations of the message space is primitive. As a consequence, we obtain that no proper and non-trivial subspace can be invariant under its action.

Recommendations

• Primitivity of the group of a cipher involving the action of the key-schedule
• Advanced Encryption Standard – AES
• scientific article; zbMATH DE number 1950346
• New representations of the AES key schedule
• New representations of the AES key schedule

Cites work

• scientific article; zbMATH DE number 1682693 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• scientific article; zbMATH DE number 503331 (Why is no real title available?)
• scientific article; zbMATH DE number 1394295 (Why is no real title available?)
• scientific article; zbMATH DE number 1418254 (Why is no real title available?)
• A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
• A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro
• A new structural-differential property of 5-round AES
• A note on some algebraic trapdoors for block ciphers
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Group theoretic properties of Rijndael-like ciphers
• Improved impossible differential cryptanalysis of 7-round AES-128
• Making the impossible possible
• New representations of the AES key schedule
• On invariant subspaces in the Lai-Massey scheme and a primitivity reduction
• On some block ciphers and imprimitive groups
• Primitivity of PRESENT and other lightweight ciphers
• Primitivity of the group of a cipher involving the action of the key-schedule
• Proving resistance against invariant attacks: how to choose the round constants
• Related-Key Cryptanalysis of the Full AES-192 and AES-256
• Some group-theoretical results on Feistel networks in a long-key scenario
• The exchange attack: how to distinguish six rounds of AES with \(2^{88.2}\) chosen plaintexts
• The group generated by the round functions of a GOST-like cipher
• The retracing boomerang attack
• The round functions of KASUMI generate the alternating group
• Wave-shaped round functions and primitive groups
• Yoyo tricks with AES

Cited in

(1)

• Primitivity of PRESENT and other lightweight ciphers

This page was built for publication: On the primitivity of the AES-128 key-schedule

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