Cryptography, Cybersecurity, Number Theory, Information Security, Rsa.
computationally solved easily. NP is set of problems that can be computationally verified easily. Here, “easily” is defined as polynomial time or better. P vs NP asks: “Can every problem whose solution can be verified quickly with a computer, can also be solved quickly with a computer?”. P = NP