Define the classes P and NP in the context of computational complexity theory. Explain why the question of whether P equals NP is considered one of the most important open problems in mathematics and computer science. Discuss the theoretical consequences for cryptography, optimization, and algorithmic efficiency if P were proven to equal NP, and conversely if they were proven to be distinct.