Differential uniformity and linearity of S-boxes by multiplicative complexity
From MaRDI portal
Publication:2154885
DOI10.1007/s12095-021-00547-2zbMath1500.94031OpenAlexW4206374283WikidataQ114849180 ScholiaQ114849180MaRDI QIDQ2154885
Seung Jun Baek, Giyoon Kim, Jongsung Kim, Hangi Kim, Yongjin Jeon
Publication date: 15 July 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00547-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinearities of S-boxes
- Multiplicative complexity of vector valued Boolean functions
- On CCZ-equivalence, extended-affine equivalence, and function twisting
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
- Logic minimization techniques with applications to cryptology
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Algorithms in HElib
- LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations
- Ciphers for MPC and FHE
- Constructing S-boxes with low multiplicative complexity
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Improved Garbled Circuit: Free XOR Gates and Applications
- PRESENT: An Ultra-Lightweight Block Cipher
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
- Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes
- Concrete Multiplicative Complexity of Symmetric Functions
This page was built for publication: Differential uniformity and linearity of S-boxes by multiplicative complexity
