Conversion from arithmetic to Boolean masking with logarithmic complexity
From MaRDI portal
Publication:2946940
DOI10.1007/978-3-662-48116-5_7zbMATH Open1367.94305OpenAlexW2152881483MaRDI QIDQ2946940FDOQ2946940
Authors: Jean-Sébastien Coron, Johann Großschädl, Mehdi Tibouchi, Praveen Kumar Vadnala 
Publication date: 18 September 2015
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: http://link.springer.com/chapter/10.1007/978-3-662-48116-5_7
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 (13)
- Secure conversion between Boolean and arithmetic masking of any order
- Addition with blinded operands
- Efficient conversion method from arithmetic to Boolean masking in constrained devices
- High-order conversion from Boolean to arithmetic masking
- Realization of Boolean functions by one linear arithmetic polynomial with masking
- Arithmetic Addition over Boolean Masking
- One-hot conversion: towards faster table-based A2B conversion
- Secure Implementation of Lattice-Based Encryption Schemes
- 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
- Raccoon: a masking-friendly signature proven in the probing model
- Formal verification of arithmetic masking in hardware and software
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)
