blintz base personal blog
Why cryptography is not based on NP-complete problems
Cryptographic schemes are based on the computational difficulty of solving some ‘hard’ problem. For example, RSA (specifically, RSA-2048) is based on the difficulty of a problem like this:
- Points
- 120
- HN comments
- 56
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSecurity & Privacy2025
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Feb 13, 2025 | Why cryptography is not based on NP-complete problems by blintz | 120 | 56 |
