Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
From MaRDI portal
Recommendations
- A new algorithm for switching from arithmetic to Boolean masking.
- scientific article; zbMATH DE number 1878319
- Conversion from arithmetic to Boolean masking with logarithmic complexity
- High-order conversion from Boolean to arithmetic masking
- Efficient conversion method from arithmetic to Boolean masking in constrained devices
- A fast algorithm for the Boolean masking problem
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- Secure conversion between Boolean and arithmetic masking of any order
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
- Realization of systems of Boolean functions by linear arithmetic polynomials with masking
Cited in
(9)- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
- Arithmetic Addition over Boolean Masking
- Addition with blinded operands
- scientific article; zbMATH DE number 1759296 (Why is no real title available?)
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- scientific article; zbMATH DE number 1878319 (Why is no real title available?)
- High-order conversion from Boolean to arithmetic masking
- A new algorithm for switching from arithmetic to Boolean masking.
- Secure conversion between Boolean and arithmetic masking of any order
This page was built for publication: Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189994)