Define the complexity classes P and NP. Explain the theoretical significance of the P vs NP problem, particularly regarding verification versus solution discovery. Discuss the concept of NP-completeness, provide examples of NP-complete problems (such as the Traveling Salesman or Boolean Satisfiability), and explain the consequences for cryptography if P were proven to equal NP.