Multiplicative complexity of bijective 4 4 S-boxes
From MaRDI portal
Publication:2016430
DOI10.1007/S12095-014-0100-YzbMATH Open1294.94087OpenAlexW1994781818WikidataQ114221281 ScholiaQ114221281MaRDI QIDQ2016430FDOQ2016430
Authors: Pavol Zajac, Matúš Jókay 
Publication date: 20 June 2014
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-014-0100-y
Recommendations
- Constructing S-boxes with low multiplicative complexity
- Differential uniformity and linearity of S-boxes by multiplicative complexity
- The multiplicative complexity of Boolean functions on four and five variables
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- Cryptographic analysis of all \(4 \times 4\)-bit s-boxes
Cites Work
- Title not available (Why is that?)
- Cryptographic analysis of all \(4 \times 4\)-bit s-boxes
- PRESENT: An Ultra-Lightweight Block Cipher
- On the Classification of 4 Bit S-Boxes
- Tight bounds for the multiplicative complexity of symmetric functions
- Title not available (Why is that?)
- On multiplication in finite fields
- A new method to solve MRHS equation systems and its connection to group factorization
- Threshold implementations of all \(3 \times 3\) and \(4 \times 4\) S-boxes
- The multiplicative complexity of quadratic boolean forms
- Higher-order masking schemes for S-boxes
Cited In (6)
- From cryptanalysis to cryptographic property of a Boolean function
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- Constructing S-boxes with low multiplicative complexity
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
- A lower bound for differential uniformity by multiplicative complexity \& bijective functions of multiplicative complexity 1 over finite fields
- Differential uniformity and linearity of S-boxes by multiplicative complexity
Uses Software
This page was built for publication: Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016430)
