Explain the P vs NP problem in theoretical computer science without using code. Focus on the distinction between problems that are easy to solve (P) versus problems that are easy to verify but potentially hard to solve (NP). Discuss the implications for cryptography if it were proven that P equals NP. Why do most theorists believe P does not equal NP?