Define the classes P and NP in computational complexity theory. Explain the relationship between decision problems and verification. Provide examples of problems known to be in P and problems known to be in NP (but not necessarily known to be in P). Discuss the implications of P equaling NP versus P not equaling NP for cryptography and optimization.