Efficient and provably secure methods for switching from arithmetic to Boolean masking
From MaRDI portal
Recommendations
- Secure conversion between Boolean and arithmetic masking of any order
- Conversion from arithmetic to Boolean masking with logarithmic complexity
- A new algorithm for switching from arithmetic to Boolean masking.
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- High-order conversion from Boolean to arithmetic masking
Cited in
(19)- Fast verification of masking schemes in characteristic two
- Arithmetic Addition over Boolean Masking
- Addition with blinded operands
- Conversion from arithmetic to Boolean masking with logarithmic complexity
- On the computational soundness of cryptographically masked flows
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- scientific article; zbMATH DE number 1878319 (Why is no real title available?)
- High-order conversion from Boolean to arithmetic masking
- Маскирование ГОСТ 28147-89 для защиты от атак по побочным каналам
- A new algorithm for switching from arithmetic to Boolean masking.
- Efficient conversion method from arithmetic to Boolean masking in constrained devices
- Secure conversion between Boolean and arithmetic masking of any order
- Cryptographic Hardware and Embedded Systems - CHES 2004
- One-hot conversion: towards faster table-based A2B conversion
- Fast first-order masked NTTRU
- A lightweight implementation of Saber resistant against side-channel attacks
- Secure Implementation of Lattice-Based Encryption Schemes
- Formal verification of arithmetic masking in hardware and software
This page was built for publication: Efficient and provably secure methods for switching from arithmetic to Boolean masking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649771)
