Complexity: NP-intermediate as of 2020:

- expected not to be NP-complete because it would imply NP != Co-NP: https://cstheory.stackexchange.com/questions/167/what-are-the-consequences-of-factoring-being-np-complete#comment104849_169
- expected not to be in P because "could we be that dumb that we haven't found a solution after having tried for that long?

The basis of RSA: RSA. But not proved NP-complete, which leads to:

- 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

- Discrete logarithm | 40
- NP-hard cryptosystems | 93
- RSA | 213, 376, 2