Provide a comprehensive analysis of the P vs NP problem. Discuss the definitions of P and NP, the concept of NP-completeness, and the implications for cryptography and optimization if P were to equal NP versus if P does not equal NP. Include examples of NP-complete problems.