Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
From MaRDI portal
Publication:3297548
DOI10.1007/978-3-319-89641-0_1zbMath1450.94032OpenAlexW2798219476WikidataQ58764866 ScholiaQ58764866MaRDI QIDQ3297548
Matthieu Rivain, Anthony Journault, Dahmun Goudarzi, François-Xavier Standaert
Publication date: 20 July 2020
Published in: Constructive Side-Channel Analysis and Secure Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-89641-0_1
Related Items (5)
Secure wire shuffling in the probing model ⋮ \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations ⋮ Fast verification of masking schemes in characteristic two ⋮ bitslice-masking-multiplication ⋮ Custom instruction support for modular defense against side-channel and fault attacks
Uses Software
Cites Work
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- Higher-Order Side Channel Security and Mask Refreshing
- Provably Secure Higher-Order Masking of AES
- Conversion of Security Proofs from One Leakage Model to Another: A New Issue
- Masking against Side-Channel Attacks: A Formal Security Proof
- Towards sound approaches to counteract power-analysis attacks
- Very High Order Masking: Efficient Implementation and Security Evaluation
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Advances in Cryptology - CRYPTO 2003
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- How Fast Can Higher-Order Masking Be in Software?
- Randomness Complexity of Private Circuits for Multiplication
- Unnamed Item
This page was built for publication: Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
