Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria.
WeiGuo ZhangEnes PasalicPublished in: Inf. Sci. (2017)
Keyphrases
- boolean functions
- lower bound
- bi decomposition
- statistical queries
- functional properties
- upper bound
- uniform distribution
- disjunctive normal form
- linear functions
- monotone boolean functions
- multi valued
- membership queries
- threshold functions
- relevant variables
- objective function
- read once formulas
- branch and bound algorithm
- branch and bound
- prime implicants
- concept class
- binary decision diagrams
- worst case
- optimal solution
- dnf formulae
- dnf formulas
- learning theory
- sample size
- decision trees