A Note on 5-bit Quadratic Permutations’ Classification
Keywords: Permutation, S-box, classification, affine equivalence, vectorial Boolean function
AbstractClassification of vectorial Boolean functions up to affine equivalence is used widely to analyze various cryptographic and implementation properties of symmetric-key algorithms. We show that there exist 75 affine equivalence classes of 5-bit quadratic permutations. Furthermore, we explore important cryptographic properties of these classes, such as linear and differential properties and degrees of their inverses, together with multiplicative complexity and existence of uniform threshold realizations.
How to Cite
Božilov, D., Bilgin, B., & Sahin, H. A. (2017). A Note on 5-bit Quadratic Permutations’ Classification. IACR Transactions on Symmetric Cryptology, 2017(1), 398-404. https://doi.org/10.13154/tosc.v2017.i1.398-404
Copyright (c) 2017 Dušan Božilov, Begül Bilgin, Hacı Ali Sahin
This work is licensed under a Creative Commons Attribution 4.0 International License.