[strulovich]

Generally, all problems used for crypto are in NP. Since given the secret, you need to be able to compute it efficiently.

It’s just that being NP hard or complete is not enough.

The theoretical definition of one way functions is used to define cryptography. So reading on that my clarify this some more.