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, 501, 5
- Decision problem | 73, 583, 7
- Computational problem | 15, 923, 20
- Computer science | 240, 2k, 68
- Computer | 136, 21k, 532
- Technology | 0, 33k, 758
- Ciro Santilli's Homepage | 238, 147k, 2k

- Discrete logarithm | 34
- NP-hard cryptosystems | 91
- RSA | 211, 364, 2