Popular：
Virtualization DNS security formal verification reachability analysis compiler errors macro conflict web extension development framework Bitmap Graphics API inconsistencies All Tags

Cryptography Isn't Based on NP-Complete Problems

2025-02-13

This article explains why cryptography doesn't rely on NP-complete problems. While NP-complete problems are hard to solve quickly, cryptography needs problems that are hard on average, meaning a randomly selected instance is difficult to crack. RSA is an example; it relies on the difficulty of factoring large numbers, which is hard on average. NP-complete problems only guarantee hardness in the worst case, not average-case hardness, making them unsuitable for cryptography.

(blintzbase.com)
Development NP-complete problems