Secure conversion between Boolean and arithmetic masking of any order
From MaRDI portal
Publication:5265080
Recommendations
- High-order conversion from Boolean to arithmetic masking
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- Conversion from arithmetic to Boolean masking with logarithmic complexity
- A new algorithm for switching from arithmetic to Boolean masking.
Cited in
(16)- Efficient conversion method from arithmetic to Boolean masking in constrained devices
- High-order conversion from Boolean to arithmetic masking
- A lightweight implementation of Saber resistant against side-channel attacks
- Arithmetic Addition over Boolean Masking
- One-hot conversion: towards faster table-based A2B conversion
- Conversion from arithmetic to Boolean masking with logarithmic complexity
- Higher-order masked Saber
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- Masking the GLP lattice-based signature scheme at any order
- scientific article; zbMATH DE number 1878319 (Why is no real title available?)
- Fast first-order masked NTTRU
- Raccoon: a masking-friendly signature proven in the probing model
- Masking Gaussian elimination at arbitrary order with application to multivariate-and code-based PQC
- Masking large keys in hardware: a masked implementation of McEliece
- Formal verification of arithmetic masking in hardware and software
This page was built for publication: Secure conversion between Boolean and arithmetic masking of any order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265080)