International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

A Note on 5-bit Quadratic Permutations' Classification

Authors:
Dusan Bozilov , NXP Semiconductors, Leuven; imec-COSIC, ESAT, KU Leuven, Leuven
Begül Bilgin , imec-COSIC, ESAT, KU Leuven, Leuven
Haci Ali Sahin , Institute of Applied Mathematics, Middle East Technical University, Ankara
Download:
DOI: 10.13154/tosc.v2017.i1.398-404
URL: http://tosc.iacr.org/index.php/ToSC/article/view/601
Search ePrint
Search Google
Abstract: Classification 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.
BibTeX
@article{tosc-2017-28106,
  title={A Note on 5-bit Quadratic Permutations' Classification},
  journal={IACR Trans. Symmetric Cryptol.},
  publisher={Ruhr-Universität Bochum},
  volume={2017, Issue 1},
  pages={398-404},
  url={http://tosc.iacr.org/index.php/ToSC/article/view/601},
  doi={10.13154/tosc.v2017.i1.398-404},
  author={Dusan Bozilov and Begül Bilgin and Haci Ali Sahin},
  year=2017
}