Multiplicative complexity of bijective 4×4 S-boxes
Authors:
- 9 May 2014
- journal article
- Published by Springer Nature in Cryptography and Communications
- Vol. 6 (3) , 255-277
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A new method to solve MRHS equation systems and its connection to group factorizationJournal of Mathematical Cryptology, 2013
- Cryptographic Analysis of All 4 × 4-Bit S-Boxes2012
- Higher-Order Masking Schemes for S-BoxesLecture Notes in Computer Science, 2012
- Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes2012
- On multiplication in finite fieldsJournal of Complexity, 2010
- Tight bounds for the multiplicative complexity of symmetric functionsTheoretical Computer Science, 2008
- On the Classification of 4 Bit S-Boxes2007
- PRESENT: An Ultra-Lightweight Block Cipher2007
- A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms2003
- The multiplicative complexity of quadratic boolean formsTheoretical Computer Science, 1992