Commutative Cryptanalysis Made Practical

Abstract: About 20 years ago, Wagner showed that most of the (then) known techniques used in the cryptanalysis of block ciphers were particular cases of what he called commutative diagram cryptanalysis. However, to the best of our knowledge, this general framework has not yet been leveraged to find concrete attacks. In this paper, we focus on a particular case of this framework and develop commutative cryptanalysis, whereby an attacker targeting a primitive E constructs affine permutations A and B such that E ○ A = B ○ E with a high probability, possibly for some weak keys. We develop the tools needed for the practical use of this technique: first, we generalize differential uniformity into “A-uniformity” and differential trails into “commutative trails”, and second we investigate the commutative behaviour of S-box layers, matrix multiplications, and key additions. Equipped with these new techniques, we find probability-one distinguishers using only two chosen plaintexts for large classes of.... https://tosc.iacr.org/index.php/ToSC/article/view/11290

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Commutative Cryptanalysis Made Practical ; volume:2023 ; number:4 ; year:2023 ; IACR transactions on symmetric cryptology ; 2023, Heft 4 (2023)

Contributors, Places and Time

• Creator: Baudrin, Jules ; Felke, Patrick ; Leander, Gregor ; Neumann, Patrick ; Perrin, Léo ; Stennes, Lukas

Further information

• DOI: 10.46586/tosc.v2023.i4.299-329
• URN: urn:nbn:de:101:1-2023122717545217420563
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 15.08.2025, 7:36 AM CEST