High-order conversion from Boolean to arithmetic masking

DOI10.1007/978-3-319-66787-4_5zbMATH Open1450.94031OpenAlexW2612018177MaRDI QIDQ5114629FDOQ5114629

Authors: Jean-Sébastien Coron 

Publication date: 24 June 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://eprint.iacr.org/2017/252.pdf

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.

zbMATH Keywords

high-order Boolean to arithmetic conversion algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cited In (11)

• 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
• 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
• Cryptographic Hardware and Embedded Systems - CHES 2004
• 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: 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)