Define complexity classes P (problems solvable in polynomial time) and NP (problems verifiable in polynomial time). Explain the theoretical significance of the P vs NP question. Discuss the concept of NP-Complete problems and provide examples. Explore the implications for cryptography and optimization if P were to equal NP.