Define the classes P and NP within computational complexity theory. Explain the significance of the P vs NP question. Discuss the theoretical implications for cryptography, optimization, and mathematical proof if P were to equal NP, or if it were proven that P does not equal NP.