Define the complexity classes P and NP in the context of computational theory. Explain the theoretical significance of the P versus NP problem. Discuss the implications if it were proven that P equals NP, specifically focusing on the impact on cryptography, optimization problems, and mathematical proof generation.