Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison

DOI10.1007/978-3-319-89641-0_1MaRDI QIDQ3297548zbMATH OpenOpenAlexWikidataFDO

Authors Dahmun Goudarzi, Anthony Journault, Matthieu Rivain, 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Secure multiplicative masking of power functions
• Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks
• Very high order masking: efficient implementation and security evaluation
• Efficient and provably secure methods for switching from arithmetic to Boolean masking
• Higher-order masking schemes for S-boxes
• Provably secure higher-order masking of AES
• Side Channel Cryptanalysis of a Higher Order Masking Scheme
• A fast and provably secure higher-order masking of AES S-box
• scientific article; zbMATH DE number 1979285

Cites work

• Advances in Cryptology - CRYPTO 2003
• Conversion of security proofs from one leakage model to another: a new issue
• Higher-order side channel security and mask refreshing
• Horizontal side-channel attacks and countermeasures on the ISW masking scheme
• How fast can higher-order masking be in software?
• scientific article; zbMATH DE number 1759267 (Why is no real title available?)
• Masking against Side-Channel Attacks: A Formal Security Proof
• Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
• Provably secure higher-order masking of AES
• Randomness complexity of private circuits for multiplication
• Towards sound approaches to counteract power-analysis attacks
• Unifying leakage models: from probing attacks to noisy leakage.
• Very high order masking: efficient implementation and security evaluation

Cited in

(13)

• New instantiations of the CRYPTO 2017 masking schemes
• Tornado: automatic generation of probing-secure masked bitsliced implementations
• Fast verification of masking schemes in characteristic two
• Custom instruction support for modular defense against side-channel and fault attacks
• Secure wire shuffling in the probing model
• Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
• Packed multiplication: how to amortize the cost of side-channel masking?
• An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Very high order masking: efficient implementation and security evaluation
• bitslice-masking-multiplication
• From arithmetic to Shamir: secure and efficient masking gadgets for multiplications. Applications to the post-quantum signature scheme MQOM
• \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297548)