Define the complexity classes P and NP in theoretical computer science. Explain the significance of the P vs NP problem. Discuss the theoretical consequences for modern cryptography and algorithmic efficiency if it were proven that P equals NP, or if P does not equal NP.