A greedy algorithm for checking normality of cryptographic boolean functions.
Nicholas KolokotronisKonstantinos LimniotisPublished in: ISITA (2012)
Keyphrases
- greedy algorithm
- boolean functions
- uniform distribution
- greedy algorithms
- objective function
- prime implicants
- worst case
- functional properties
- threshold functions
- smart card
- dnf formulae
- knapsack problem
- greedy heuristic
- set cover
- membership queries
- randomized algorithm
- influence maximization
- read once formulas
- approximation guarantees
- dynamic programming
- greedy strategy
- multi valued
- random walk
- optimization problems
- lower bound