High-Order Conversion from Boolean to Arithmetic Masking

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

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

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 (7)

• Arithmetic Addition over Boolean Masking
• Secure Implementation of Lattice-Based Encryption Schemes
• Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
• 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)