# Integer factorization | ðŸ—– nosplit | â†‘ parent "Function problem" | 87, 1, 171

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: