Define P and NP in the context of computational complexity theory. Explain the P vs NP problem and its fundamental question: If a solution to a problem can be verified quickly, can it also be solved quickly? Discuss the theoretical implications for cryptography and optimization if P were equal to NP.