publication . Article . Other literature type . 2017

A Note on 5-bit Quadratic Permutations’ Classification

Božilov, Dušan; Bilgin, Begül; Sahin, Hacı Ali;
Open Access English
  • Published: 01 Mar 2017 Journal: IACR Transactions on Symmetric Cryptology (ToSC) (issn: 2519-173X, Copyright policy)
  • Publisher: Ruhr-Universität Bochum
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.
Subjects
free text keywords: Computer engineering. Computer hardware, affine equivalence, Permutation; S-box; classification; affine equivalence; vectorial Boolean function, S-box, classification, vectorial Boolean function, Permutation, TK7885-7895
Funded by
EC| ECRYPT-NET
Project
ECRYPT-NET
European Integrated Research Training Network on Advanced Cryptographic Technologies for the Internet of Things and the Cloud
  • Funder: European Commission (EC)
  • Project Code: 643161
  • Funding stream: H2020 | MSCA-ITN-ETN
21 references, page 1 of 2

[1] Elena Andreeva, Begül Bilgin, Andrey Bogdanov, Atul Luykx, Florian Mendel, Bart Mennink, Nicky Mouha, Qingju Wang, and Kan Yasuda. CAESAR submission: PRIMATEs v1.02, March 2014. http://primates.ae/wp-content/uploads/primatesv1.02.pdf.

[2] Elwyn Berlekamp and Lloyd Welch. Weight distributions of the cosets of the (32,6) Reed-Muller code. IEEE Transactions on Information Theory, 18(1):203-207, Jan 1972.

[3] Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche. The Keccak reference, January 2011. http://keccak.noekeon.org/.

[4] Guido Bertoni, Joan Daemon, Michaël Peeters, Gilles Van Assche, and Ronny Van Keer. CAESAR submission: Ketje v1, March 2014. https://competitions.cr.yp.to/round1/ ketjev1.pdf.

[5] Guido Bertoni, Joan Daemon, Michaël Peeters, Gilles Van Assche, and Ronny Van Keer. CAESAR submission: Keyak v2, August 2015. https://competitions.cr.yp.to/round2/ keyakv2.pdf.

[6] Eli Biham and Adi Shamir. Differential cryptanalysis of DES-like cryptosystems. In International Cryptology Conference on Advances in Cryptology, CRYPTO 1990, pages 2-21, London, UK, UK, 1991. Springer-Verlag.

[7] Begül Bilgin. Threshold Implementations : As Countermeasure Against Higher-Order Differential Power Analysis. PhD thesis, May 2015. [OpenAIRE]

[8] Begül Bilgin, Andrey Bogdanov, Miroslav Knezevic, Florian Mendel, and Qingju Wang. Fides: Lightweight authenticated cipher with side-channel resistance for constrained hardware. In Cryptographic Hardware and Embedded Systems, CHES 2013, volume 8086 of LNCS, pages 142-158, Heidelberg, Germany, 2013. Springer. [OpenAIRE]

[9] Begül Bilgin, Svetla Nikova, Ventzislav Nikov, Vincent Rijmen, Natalia Tokareva, and Valeriya Vitkup. Threshold implementations of small s-boxes. Cryptography and Communications, 7(1):3-33, 2015.

[10] Erik Boss, Vincent Grosso, Tim Güneysu, Gregor Leander, Amir Moradi, and Tobias Schneider. Strong 8-bit sboxes with efficient masking in hardware. In Cryptographic Hardware and Embedded Systems - CHES 2016, pages 171-193, Berlin, Heidelberg, 2016. Springer Berlin Heidelberg.

[11] Marcus Brinkmann and Gregor Leander. On the classification of APN functions up to dimension five. Designs, Codes and Cryptography, 49(1):273-288, 2008.

[12] Florent Chabaud and Serge Vaudenay. Links between differential and linear cryptanalysis. In Advances in Cryptology - EUROCRYPT 1994, pages 356-365, Berlin, Heidelberg, 1995. Springer Berlin Heidelberg.

[13] Nicolas Courtois, Daniel Hulme, and Theodosis Mourouzis. Multiplicative complexity and solving generalized brent equations with SAT solvers. In The Third International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking, pages 22-27, 2012.

[14] Christophe De Cannière. Analysis and Design of Symmetric Encryption Algorithms. PhD thesis, 2007.

[15] Christoph Dobraunig, Maria Eichlseder, and Florian Mendel. Higher-order cryptanalysis of LowMC. In Information Security and Cryptology - ICISC 2015, LNCS, pages 87-101. Springer, 2015.

21 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . Other literature type . 2017

A Note on 5-bit Quadratic Permutations’ Classification

Božilov, Dušan; Bilgin, Begül; Sahin, Hacı Ali;