Define P and NP complexity classes in theoretical computer science. Explain the implications if P were to equal NP. Discuss the significance of this problem to modern cryptography and algorithm design without using any code.