Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity

DOI10.1007/978-3-662-48116-5_7zbMath1367.94305OpenAlexW2152881483MaRDI QIDQ2946940

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

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: http://link.springer.com/chapter/10.1007/978-3-662-48116-5_7

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

One-hot conversion: towards faster table-based A2B conversion ⋮ Secure Implementation of Lattice-Based Encryption Schemes ⋮ Masking the GLP lattice-based signature scheme at any order ⋮ Arithmetic Addition over Boolean Masking

This page was built for publication: Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity