Patrick Neumann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Patrick Neumann has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Gregor Leander
Ruhr University Bochum
5 shared publications - Lukas Stennes
Ruhr University Bochum, Bochum, Germany
3 shared publications - Patrick Felke
University of Applied Sciences Emden/Leer, Emden, Germany
3 shared publications - Christof Beierle
Ruhr University Bochum
2 shared publications - Jules Baudrin
INRIA, Paris, France
2 shared publications - Léo Perrin
INRIA, Paris, France
2 shared publications
Latest Publications
- 11 August 2026
- Published by Springer Nature
- p. 353-373
Meet-in-the-Middle Attacks on Full ChiLow
- 8 December 2025
- Published by Springer Nature
- p. 253-284
The State-Test Technique on Differential Attacks: a 26-Round Attack on Craft and Other Applications
- 8 December 2025
- Published by Springer Nature
- p. 253-284
The State-Test Technique on Differential Attacks: a 26-Round Attack on Craft and Other Applications
- Open Access
- 10 May 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 3243-3281
Commutative cryptanalysis as a generalization of differential cryptanalysis
Recently, Baudrin et al. analyzed a special case of Wagner’s commutative diagram cryptanalysis, referred to as commutative cryptanalysis. For a family $$(E_k)_k$$ of permutations on a finite vector space G, commutative cryptanalysis exploits the existence of affine permutations $$A,B :G \rightarrow G$$ , $$I \notin \{A,B\}$$ such that $$E_k \circ A (x) = B \circ E_k(x)$$ holds with high probability, taken over inputs x, for a significantly large set of weak keys k. Several attacks against symmetric cryptographic primitives can be formulated within the framework of commutative cryptanalysis, most importantly differential attacks, as well as rotational and rotational-differential attacks. Besides, the notion of c-differentials on S-boxes can be analyzed as a special case within this framework. We discuss the relations between a general notion of commutative cryptanalysis, with A and B being arbitrary functions over a finite Abelian group, and differential cryptanalysis, both from the view of conducting an attack on a symmetric cryptographic primitive, as well as from the view of a theoretical study of cryptographic S-boxes.- 10 May 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 3243-3281
Open AccessCommutative cryptanalysis as a generalization of differential cryptanalysis
Recently, Baudrin et al. analyzed a special case of Wagner’s commutative diagram cryptanalysis, referred to as commutative cryptanalysis. For a family $$(E_k)_k$$ of permutations on a finite vector space G, commutative cryptanalysis exploits the existence of affine permutations $$A,B :G \rightarrow G$$ , $$I \notin \{A,B\}$$ such that $$E_k \circ A (x) = B \circ E_k(x)$$ holds with high probability, taken over inputs x, for a significantly large set of weak keys k. Several attacks against symmetric cryptographic primitives can be formulated within the framework of commutative cryptanalysis, most importantly differential attacks, as well as rotational and rotational-differential attacks. Besides, the notion of c-differentials on S-boxes can be analyzed as a special case within this framework. We discuss the relations between a general notion of commutative cryptanalysis, with A and B being arbitrary functions over a finite Abelian group, and differential cryptanalysis, both from the view of conducting an attack on a symmetric cryptographic primitive, as well as from the view of a theoretical study of cryptographic S-boxes. - Open Access
- 8 December 2023
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2023 (4) , 299-329
Commutative Cryptanalysis Made Practical
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 weak keys in both a modified Midori and in Scream. For the same weak keys, we deduce high probability truncated differentials that can cover an arbitrary number of rounds, but which do not correspond to any high probability differential trails. Similarly, we show the existence of a trade-off in our variant of Midori whereby the probability of the commutative trail can be decreased in order to increase the weak key density. We also show some statistical patterns in the AES super S-box that have a much higher probability than the best differentials, and which hold for a class of weak keys of density about 2−4.5.
- 8 December 2023
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2023 (4) , 299-329
Open AccessCommutative Cryptanalysis Made Practical
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 weak keys in both a modified Midori and in Scream. For the same weak keys, we deduce high probability truncated differentials that can cover an arbitrary number of rounds, but which do not correspond to any high probability differential trails. Similarly, we show the existence of a trade-off in our variant of Midori whereby the probability of the commutative trail can be decreased in order to increase the weak key density. We also show some statistical patterns in the AES super S-box that have a much higher probability than the best differentials, and which hold for a class of weak keys of density about 2−4.5.
- 9 August 2023
- Published by Springer Nature
- p. 209-239
On Perfect Linear Approximations and Differentials over Two-Round SPNs
- 9 August 2023
- Published by Springer Nature
- p. 209-239
On Perfect Linear Approximations and Differentials over Two-Round SPNs
- 15 April 2023
- Published by Springer Nature
- p. 318-347
Pitfalls and Shortcomings for Decompositions and Alignment
- 15 April 2023
- Published by Springer Nature
- p. 318-347
Pitfalls and Shortcomings for Decompositions and Alignment
- Open Access
- 24 April 2019
- Published by Springer Nature
- p. 585-616
bison Instantiating the Whitened Swap-Or-Not Construction
- 24 April 2019
- Published by Springer Nature
- p. 585-616
Open Accessbison Instantiating the Whitened Swap-Or-Not Construction