A new algorithm for switching from arithmetic to Boolean masking.

DOI10.1007/978-3-540-45238-6_8MaRDI QIDQ5187951zbMATH OpenOpenAlexFDO

Authors Jean-Sébastien Coron, Alexei Tchulkine

Publication date 9 March 2010

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

Full work available at URL https://doi.org/10.1007/978-3-540-45238-6_8

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1878319
• 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
• scientific article; zbMATH DE number 1759296

Cited in

(14)

• On two DES implementations secure against differential power analysis in smart-cards
• Addition with blinded operands
• Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
• scientific article; zbMATH DE number 1759296 (Why is no real title available?)
• Efficient and provably secure methods for switching from arithmetic to Boolean masking
• scientific article; zbMATH DE number 1878319 (Why is no real title available?)
• 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
• Cryptographic Hardware and Embedded Systems - CHES 2004
• One-hot conversion: towards faster table-based A2B conversion
• Fast first-order masked NTTRU
• A lightweight implementation of Saber resistant against side-channel attacks
• Formal verification of arithmetic masking in hardware and software

This page was built for publication: A new algorithm for switching from arithmetic to Boolean masking.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187951)