Login / Signup
On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking.
Dahmun Goudarzi
Matthieu Rivain
Published in:
IACR Cryptol. ePrint Arch. (2016)
Keyphrases
</>
boolean functions
higher order
uniform distribution
polynomial size
threshold functions
prime implicants
relevant variables
functional properties
pairwise
dnf formulae
computational complexity
membership queries
bounded treewidth
worst case
multi valued
read once formulas
bi decomposition