Explain the theoretical distinction between the complexity classes P and NP. Discuss the significance of the question of whether P equals NP for fields such as cryptography, optimization, and algorithm design. Provide examples of problems that fall into each category and describe the concept of polynomial-time reduction.