Recommendations
Cited in
(54)- 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
- Detecting side channel vulnerabilities in improved rotating S-box masking scheme -- presenting four non-profiled attacks
- Unifying leakage models: from probing attacks to noisy leakage
- Revisiting a masked lookup-table compression scheme
- Statistical properties of side-channel and fault injection attacks using coding theory
- The multiplicative complexity of 6-variable Boolean functions
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- A number theoretic view on binary shift registers
- Secure wire shuffling in the probing model
- Upper bounds on the multiplicative complexity of symmetric Boolean functions
- Consolidating inner product masking
- Decomposition of permutations in a finite field
- Packed multiplication: how to amortize the cost of side-channel masking?
- Polynomial evaluation and side channel analysis
- High-order masking by using coding theory and its application to AES
- Leakage squeezing of order two
- Masking with randomized look up tables. Towards preventing side-channel attacks of all orders
- A first-order leak-free masking countermeasure
- Masks will fall off. Higher-order optimal distinguishers
- Higher-order side channel security and mask refreshing
- Masking tables -- an underestimated security risk
- LS-designs: bitslice encryption for efficient masked software implementations
- Higher-order glitch resistant implementation of the PRESENT S-box
- Verified Proofs of Higher-Order Masking
- Inner product masking revisited
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- A fast and provably secure higher-order masking of AES S-box
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- Threshold implementation in software. Case study of PRESENT
- Algebraic decomposition for probing security
- Consolidating masking schemes
- A Very Compact “Perfectly Masked” S-Box for AES
- Secure multiplicative masking of power functions
- Provably secure higher-order masking of AES
- Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers
- Threshold implementations of all 3 3 and 4 4 S-boxes
- Efficient masked S-boxes processing -- a step forward
- Constructing 8-bit permutations, 8-bit involutions and 8-bit orthomorphisms with almost optimal cryptographic parameters
- Reconciling \((d+1)\) masking in hardware and software
- Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures
- Higher order masking of look-up tables
- Fast Software Encryption
- How fast can higher-order masking be in software?
- Topics in Cryptology – CT-RSA 2006
- On decompositions of permutation polynomials into quadratic and cubic power permutations
- Faster secure multi-party computation of AES and DES using lookup tables
- Automated verification of correctness for masked arithmetic programs
- Mask compression: high-order masking on memory-constrained devices
- Leakage squeezing: optimal implementation and security evaluation
- Correlation power analysis and higher-order masking implementation of WAGE
This page was built for publication: Higher-order masking schemes for S-boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899715)
