Affine equivalence in the AES round function

DOI10.1016/J.DAM.2005.02.001MaRDI QIDQ2486749zbMATH OpenOpenAlexFDO

Authors A. M. Youssef, Stafford E. Tavares

Publication date 17 August 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.02.001

zbMATH Keywords

advanced encryption standardBoolean functionscryptographyfinite fieldsRijndael

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Review text

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.

Recommendations

• A linear equivalence algorithm
• Analyzing the influence of linear redundancy in S-boxes on the affine equivalence within XSL-like round functions
• A toolbox for cryptanalysis: Linear and affine equivalence algorithms
• scientific article; zbMATH DE number 5242716
• On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks

Cites work

• A simple algebraic representation of Rijndael
• Cryptanalysis of block ciphers with probabilistic nonlinear relations of low degree
• Differential cryptanalysis of DES-like cryptosystems
• Differentially uniform mappings for cryptography
• Essential algebraic structure within the AES
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 4083539 (Why is no real title available?)
• Linear cryptanalysis method for DES cipher
• Linear redundancy in S-boxes.
• On the interpolation attacks on block ciphers
• The design of Rijndael. AES -- the Advanced Encryption Standard
• The interpolation attack on block ciphers
• Transform domain analysis of DES

Cited in

(8)

• 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
• Complementation-like and cyclic properties of AES round functions
• 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)