Multiplicative complexity of bijective 4 4 S-boxes
From MaRDI portal
Publication:2016430
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
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 2009947 (Why is no real title available?)
- A new method to solve MRHS equation systems and its connection to group factorization
- Cryptographic analysis of all \(4 \times 4\)-bit s-boxes
- Higher-order masking schemes for S-boxes
- On multiplication in finite fields
- On the Classification of 4 Bit S-Boxes
- PRESENT: An Ultra-Lightweight Block Cipher
- The multiplicative complexity of quadratic boolean forms
- Threshold implementations of all \(3 \times 3\) and \(4 \times 4\) S-boxes
- Tight bounds for the multiplicative complexity of symmetric functions
Cited in
(6)- Constructing S-boxes with low multiplicative complexity
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- From cryptanalysis to cryptographic property of a Boolean function
- 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
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
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)
