On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
From MaRDI portal
Publication:1695993
DOI10.1007/978-3-662-53140-2_22zbMATH Open1411.94063OpenAlexW2497251496MaRDI QIDQ1695993FDOQ1695993
Authors: Dahmun Goudarzi, Matthieu Rivain 
Publication date: 14 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-662-53140-2_22
Recommendations
- On the multiplicative complexity of Boolean functions
- On the multiplicative complexity of some Boolean functions
- scientific article; zbMATH DE number 4108153
- Multiplicative complexity of some Boolean functions
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Upper bounds on the multiplicative complexity of symmetric Boolean functions
- Circuit complexity and multiplicative complexity of Boolean functions
- On the modulo degree complexity of Boolean functions
- On the modulo degree complexity of Boolean functions
- The complexity of the representation of multiple-output Boolean functions
Cited In (5)
- LS-designs: bitslice encryption for efficient masked software implementations
- Higher-order masking schemes for S-boxes
- How fast can higher-order masking be in software?
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- On compiling Boolean circuits optimized for secure multi-party computation
Uses Software
This page was built for publication: On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1695993)
