On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
From MaRDI portal
Publication:1695993
DOI10.1007/978-3-662-53140-2_22zbMath1411.94063OpenAlexW2497251496MaRDI QIDQ1695993
Matthieu Rivain, Dahmun Goudarzi
Publication date: 14 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-662-53140-2_22
Related Items (2)
On compiling Boolean circuits optimized for secure multi-party computation ⋮ How Fast Can Higher-Order Masking Be in Software?
Uses Software
This page was built for publication: On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
