The so-called knapsack problem was one of the first problems used for public key methods. The description is simple: Given a backpack that can carry a certain weight and a large number of objects with different masses. The problem is to choose what to put in the backpack to fill it optimally. For a large number of objects, this is really a hard problem; however, the algorithms based on it have now all been shown to be unsafe.
Recent Posts
- Newly published: Atos whitepaper on post-quantum cryptography
- Newly published: cryptovision special issue of “The Vault” magazine
- US standards body NIST announces four winners in post-quantum competition
- Mindshare 2022 video: Two great days in 70 seconds
- New GreenShield version receives BSI approval