Conversion from arithmetic to Boolean masking with logarithmic complexity
From MaRDI portal
Recommendations
- High-order conversion from Boolean to arithmetic masking
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- Secure conversion between Boolean and arithmetic masking of any order
- scientific article; zbMATH DE number 1878319
- scientific article; zbMATH DE number 1759296
Cited in
(16)- Realization of Boolean functions by one linear arithmetic polynomial with masking
- Arithmetic Addition over Boolean Masking
- Addition with blinded operands
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- High-order conversion from Boolean to arithmetic masking
- Efficient conversion method from arithmetic to Boolean masking in constrained devices
- Secure conversion between Boolean and arithmetic masking of any order
- One-hot conversion: towards faster table-based A2B conversion
- Secure Implementation of Lattice-Based Encryption Schemes
- Masking the GLP lattice-based signature scheme at any order
- Formal verification of arithmetic masking in hardware and software
- Raccoon: a masking-friendly signature proven in the probing model
- Side-channel analysis of arithmetic encodings for post-quantum cryptography: cautionary notes with application to Kyber
- A provably masked implementation of \textsf{BIKE} key encapsulation mechanism
- Masked computation of the floor function and its application to the FALCON signature
This page was built for publication: Conversion from arithmetic to Boolean masking with logarithmic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946940)
