Secure Conversion between Boolean and Arithmetic Masking of Any Order
From MaRDI portal
Publication:5265080
DOI10.1007/978-3-662-44709-3_11zbMATH Open1375.94115OpenAlexW96383189MaRDI QIDQ5265080FDOQ5265080
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
Boolean maskingarithmetic maskingprovably secure maskinghigher-order SCAHMAC-SHA-1side-channel analysis (SCA)
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)