Define the classes P and NP in computational complexity theory. Explain the significance of the P vs NP problem. Discuss the implications if it were proven that P = NP versus P != NP for cryptography and algorithm design.