On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking.
Dahmun GoudarziMatthieu RivainPublished in: CHES (2016)
Keyphrases
- boolean functions
- higher order
- uniform distribution
- polynomial size
- prime implicants
- threshold functions
- dnf formulae
- functional properties
- pairwise
- multi valued
- linear threshold
- binary decision diagrams
- membership queries
- computational complexity
- machine learning
- worst case
- relevant variables
- multi class
- bi decomposition
- read once formulas
- learning algorithm