A fast and provably secure higher-order masking of AES S-box
From MaRDI portal
Publication:3172967
Recommendations
Cited in
(21)- How fast can higher-order masking be in software?
- Constructing 8-bit permutations, 8-bit involutions and 8-bit orthomorphisms with almost optimal cryptographic parameters
- Information Security and Cryptology - ICISC 2005
- Strong 8-bit sboxes with efficient masking in hardware
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- scientific article; zbMATH DE number 1979284 (Why is no real title available?)
- Vectorizing higher-order masking
- Masking tables -- an underestimated security risk
- Higher-order masking in practice: a vector implementation of masked AES for ARM NEON
- Montgomery’s Trick and Fast Implementation of Masked AES
- An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- Automated verification of correctness for masked arithmetic programs
- Two improved multiple-differential collision attacks
- Algebraic decomposition for probing security
- Statistical properties of side-channel and fault injection attacks using coding theory
- Higher-order side channel security and mask refreshing
- KVaC: key-value commitments for blockchains and beyond
- Packed multiplication: how to amortize the cost of side-channel masking?
- Polynomial evaluation and side channel analysis
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
This page was built for publication: A fast and provably secure higher-order masking of AES S-box
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172967)