Pitfalls and Shortcomings for Decompositions and Alignment (Full Version)

ePrint Report: Pitfalls and Shortcomings for Decompositions and Alignment (Full Version)

Baptiste Lambin, Gregor Leander, Patrick Neumann

In this paper we, for the first time, study the question under which circumstances decomposing a round function of a Substitution-Permutation Network is possible uniquely. More precisely, we provide necessary and sufficient criteria for the non-linear layer on when a decomposition is unique. Our results in particular imply that, when cryptographically strong S-boxes are used, the decomposition is indeed unique.


We then apply …

alignment eprint report function imply network non precisely question report results study under version