Efficient masked S-boxes processing -- a step forward
From MaRDI portal
Recommendations
Cited in
(21)- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- Strong 8-bit sboxes with efficient masking in hardware
- Reducing the number of non-linear multiplications in masking schemes
- Faster evaluation of sboxes via common shares
- An efficient affine equivalence algorithm for multiple S-boxes and a structured affine layer
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Anomalies and vector space search: tools for S-box analysis
- Polynomial evaluation and side channel analysis
- Block ciphers that are easier to mask: how far can we go?
- Time-memory trade-offs for side-channel resistant implementations of block ciphers
- Threshold implementation in software. Case study of PRESENT
- Algebraic decomposition for probing security
- Threshold implementations of all 3 3 and 4 4 S-boxes
- Higher-order masking schemes for S-boxes
- Impact of S-boxes size upon side channel resistance and block cipher design
- Minimizing S-boxes in hardware by utilizing linear transformations
- A compact bit-sliced representation of Kuznyechik S-box
- Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures
- How fast can higher-order masking be in software?
- Generalized Feistel ciphers for efficient prime field masking
- StaMAC: fault protection via stable-MAC tags
This page was built for publication: Efficient masked S-boxes processing -- a step forward
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981772)
