Knapsack cryptosystems built on NP-hard instances.
Laurent EvainPublished in: IACR Cryptol. ePrint Arch. (2008)
Keyphrases
- np hard
- knapsack problem
- optimal solution
- greedy heuristic
- dynamic programming
- randomly generated
- boolean variables
- special case
- linear programming
- linear programming relaxation
- approximation algorithms
- np complete
- scheduling problem
- exact methods
- closely related
- worst case
- np hardness
- computational complexity
- lower and upper bounds
- minimum cost
- integer programming
- upper bound
- lower bound
- signature scheme
- packing problem
- valid inequalities
- feasible solution
- constraint satisfaction problems
- set cover
- remains np hard