11.3 A MODULAR ARITHMETIC KNAPSACK PROBLEM
The first example of a public-key cryptosystem used a variant of the knapsack problem that results when integer arithmetic is replaced by modular arithmetic.
The knapsack problem modulo m in NP-complete.
Get Computer Security and Cryptography now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
