Define the classes P and NP in computational complexity theory. Discuss the theoretical implications of the P vs NP problem, specifically focusing on why proving that P does not equal NP would have profound consequences for cryptography and the limits of efficient computation.