How Fast Can Higher-Order Masking Be in Software?
From MaRDI portal
Publication:5738890
DOI10.1007/978-3-319-56620-7_20zbMath1411.94062OpenAlexW2613550625MaRDI QIDQ5738890
Dahmun Goudarzi, Matthieu Rivain
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_20
Related Items (16)
How to fool a black box machine learning based side-channel security evaluation ⋮ Strong Authenticity with Leakage Under Weak and Falsifiable Physical Assumptions ⋮ \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Efficient leakage-resilient MACs without idealized assumptions ⋮ All the AES you need on Cortex-M3 and M4 ⋮ Learning with physical rounding for linear and quadratic leakage functions ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison ⋮ Vectorizing Higher-Order Masking ⋮ Threshold Implementation in Software ⋮ Tornado: automatic generation of probing-secure masked bitsliced implementations ⋮ Fast verification of masking schemes in characteristic two ⋮ Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle
Uses Software
Cites Work
- Unnamed Item
- Improving the security and efficiency of block ciphers based on LS-designs
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Side-channel resistant crypto for less than 2,300 GE
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
- Logic minimization techniques with applications to cryptology
- Higher-Order Threshold Implementations
- Higher-Order Side Channel Security and Mask Refreshing
- LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations
- Verified Proofs of Higher-Order Masking
- Pushing the Limits: A Very Compact and a Threshold Implementation of AES
- Higher-Order Glitches Free Implementation of the AES Using Secure Multi-party Computation Protocols
- A Fast and Provably Secure Higher-Order Masking of AES S-Box
- Algebraic Decomposition for Probing Security
- A Very Compact S-Box for AES
- PRESENT: An Ultra-Lightweight Block Cipher
- Provably Secure Higher-Order Masking of AES
- Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches
- A fast new DES implementation in software
- Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes
- Higher-Order Masking Schemes for S-Boxes
- Masking against Side-Channel Attacks: A Formal Security Proof
- Towards sound approaches to counteract power-analysis attacks
- Efficient Masked S-Boxes Processing – A Step Forward –
- Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Higher Order Masking of Look-Up Tables
- Advances in Cryptology - CRYPTO 2003
This page was built for publication: How Fast Can Higher-Order Masking Be in Software?
