Write a theoretical essay on the P vs NP problem in computational complexity theory. Define P (problems solvable in polynomial time) and NP (problems verifiable in polynomial time). Speculate on the consequences for cryptography, optimization, and artificial intelligence if it were proven that P equals NP. Conversely, discuss the theoretical foundations that suggest P does not equal NP, including the concept of one-way functions.