Secure conversion between Boolean and arithmetic masking of any order

DOI10.1007/978-3-662-44709-3_11zbMATH Open1375.94115OpenAlexW96383189MaRDI QIDQ5265080FDOQ5265080

Authors: Jean-Sébastien Coron, Johann Großschädl, Praveen Kumar Vadnala 

Publication date: 21 July 2015

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44709-3_11

Recommendations

• High-order conversion from Boolean to arithmetic masking
• Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
• Efficient and provably secure methods for switching from arithmetic to Boolean masking
• Conversion from arithmetic to Boolean masking with logarithmic complexity
• A new algorithm for switching from arithmetic to Boolean masking.

zbMATH Keywords

Boolean maskingarithmetic maskingprovably secure maskinghigher-order SCAHMAC-SHA-1side-channel analysis (SCA)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (11)

• Masking Large Keys in Hardware: A Masked Implementation of McEliece
• A lightweight implementation of Saber resistant against side-channel attacks
• Arithmetic Addition over Boolean Masking
• One-hot conversion: towards faster table-based A2B conversion
• Higher-order masked Saber
• Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
• Masking the GLP lattice-based signature scheme at any order
• Title not available (Why is that?)
• Fast first-order masked NTTRU
• 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: Secure conversion between Boolean and arithmetic masking of any order

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