Conversion from arithmetic to Boolean masking with logarithmic complexity

DOI10.1007/978-3-662-48116-5_7MaRDI QIDQ2946940zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cryptography (94A60)

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)

• Arithmetic Addition over Boolean Masking
• Secure Implementation of Lattice-Based Encryption Schemes
• Raccoon: a masking-friendly signature proven in the probing model
• Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
• Efficient conversion method from arithmetic to Boolean masking in constrained devices
• Efficient and provably secure methods for switching from arithmetic to Boolean masking
• High-order conversion from Boolean to arithmetic masking
• One-hot conversion: towards faster table-based A2B conversion
• Formal verification of arithmetic masking in hardware and software
• Secure conversion between Boolean and arithmetic masking of any order
• Addition with blinded operands
• Realization of Boolean functions by one linear arithmetic polynomial with masking
• Masking the GLP lattice-based signature scheme at any order

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)