Provide a detailed theoretical explanation of the P vs NP problem. Define the classes P and NP formally, explain the concept of polynomial-time reduction and NP-completeness, and discuss the implications of a potential resolution (either P=NP or P≠NP) on cryptography and optimization.