Affine equivalence in the AES round function
Several questions and concerns have been raised about the algebraic structure of the advanced encryption standard (AES). Fuller and Millan (2003) have shown that all the coordinate functions of the Rijndael \(S\)-box can be mapped to each other using an affine transformation of the input variables. The main concern of this paper is to extend their result by using the algebraic properties of the Rijndael \(S\)-box. In particular, it is shown that all the coordinate functions of the Rijndael round function (and not just the \(S\)-box) are equivalent under an affine transformation of the input to the round function.
- A linear equivalence algorithm
- Analyzing the influence of linear redundancy in S-boxes on the affine equivalence within XSL-like round functions
- scientific article; zbMATH DE number 2009947
- scientific article; zbMATH DE number 5242716
- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
- Differential cryptanalysis of DES-like cryptosystems
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 4083539 (Why is no real title available?)
- scientific article; zbMATH DE number 1302848 (Why is no real title available?)
- scientific article; zbMATH DE number 1942409 (Why is no real title available?)
- scientific article; zbMATH DE number 1759265 (Why is no real title available?)
- scientific article; zbMATH DE number 2085198 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- Linear redundancy in S-boxes.
- The interpolation attack on block ciphers
- Transform domain analysis of DES
- On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions
- Projective aspects of the AES inversion
- Analyzing the influence of linear redundancy in S-boxes on the affine equivalence within XSL-like round functions
- Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions
- On the modification of finite field based S-box
- Advanced Encryption Standard – AES
- On the image of an affine subspace under the inverse function within a finite field
- Properties of vectorial Boolean functions with equivalent component functions
This page was built for publication: Affine equivalence in the AES round function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486749)