On the primitivity of the AES-128 key-schedule

DOI10.1142/S021949882350233XzbMATH Open1527.94014arXiv2103.06169OpenAlexW3134500512MaRDI QIDQ6090967FDOQ6090967

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)

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.

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)

Cites Work

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

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)