Explain the theoretical significance of the P vs NP problem. Define P and NP formally in terms of deterministic and non-deterministic Turing machines. Discuss the implications of a proof that P equals NP versus P not equal to NP for the field of cryptography and algorithm design.