High-order conversion from Boolean to arithmetic masking
From MaRDI portal
Recommendations
- Secure conversion between Boolean and arithmetic masking of any order
- Conversion from arithmetic to Boolean masking with logarithmic complexity
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- A new algorithm for switching from arithmetic to Boolean masking.
Cited in
(13)- Secure conversion between Boolean and arithmetic masking of any order
- Efficient conversion method from arithmetic to Boolean masking in constrained devices
- Arithmetic Addition over Boolean Masking
- Conversion from arithmetic to Boolean masking with logarithmic complexity
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- Secure Implementation of Lattice-Based Encryption Schemes
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- Masking the GLP lattice-based signature scheme at any order
- Cryptographic Hardware and Embedded Systems - CHES 2004
- REAF: replacing exponential activation function to prevent side-channel analysis
- Raccoon: a masking-friendly signature proven in the probing model
- Masking Gaussian elimination at arbitrary order with application to multivariate-and code-based PQC
- Formal verification of arithmetic masking in hardware and software
This page was built for publication: High-order conversion from Boolean to arithmetic masking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114629)
