Threshold implementations of all 3 3 and 4 4 S-boxes
From MaRDI portal
Publication:4649770
DOI10.1007/978-3-642-33027-8_5zbMATH Open1366.94478OpenAlexW1820473293MaRDI QIDQ4649770FDOQ4649770
Authors: Begül Bilgin, Svetla Nikova, Ventzislav Nikov, Vincent Rijmen, Georg Stütz
Publication date: 13 November 2012
Published in: Cryptographic Hardware and Embedded Systems – CHES 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33027-8_5
Recommendations
Cited In (31)
- Threshold implementations of small S-boxes
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- WARP: revisiting GFN for lightweight 128-bit block cipher
- Algebraic decomposition for probing security
- Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
- Constructing TI-friendly substitution boxes using shift-invariant permutations
- Several masked implementations of the Boyar-Peralta AES S-box
- Decomposition of permutations in a finite field
- Invariant subspaces in SPN block cipher
- Affine equivalence and its application to tightening threshold implementations
- Consolidating masking schemes
- How fast can higher-order masking be in software?
- ParTI -- towards combined hardware countermeasures against side-channel and fault-injection attacks
- Arithmetic Addition over Boolean Masking
- A further study on bridge structures and constructing bijective S-boxes for low-latency masking
- Threshold implementations with non-uniform inputs
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing
- Improbable differential attacks on \texttt{PRESENT} using undisturbed bits
- Constructions of S-boxes with uniform sharing
- Side-channel analysis protection and low-latency in action -- case study of PRINCE and Midori
- Design of new \(4\times 4\) S-box from finite commutative chain rings
- An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order
- Uniform first-order threshold implementations
- Spin me right round rotational symmetry for FPGA-specific AES: extended version
- Cryptanalysis of masked ciphers: a not so random idea
- Minimizing S-boxes in hardware by utilizing linear transformations
- Enabling 3-share threshold implementations for all 4-bit S-boxes
- Redefining the transparency order
- Improving first-order threshold implementations of \textsf{SKINNY}
- Differential uniformity and linearity of S-boxes by multiplicative complexity
This page was built for publication: Threshold implementations of all \(3 \times 3\) and \(4 \times 4\) S-boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649770)