This is natural question because both integer factorization and discrete logarithm are the basis for the most popular public-key cryptography systems as of 2020 (RSA and Diffie-Hellman key exchange respectively), and both are NP-intermediate. Why not use something more provenly hard?

- https://cs.stackexchange.com/questions/356/why-hasnt-there-been-an-encryption-algorithm-that-is-based-on-the-known-np-hard "Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?"

- Integer factorization | 96, 189, 1
- Function problem | 25, 517, 5
- Decision problem | 73, 599, 7
- Computational problem | 17, 1k, 22
- Computer science | 260, 3k, 72
- Computer | 138, 24k, 589
- Technology | 0, 39k, 908
- Ciro Santilli's Homepage | 262, 181k, 3k