Explain the theoretical computer science problem of P vs NP. Define what P represents (problems solvable in polynomial time) and what NP represents (problems verifiable in polynomial time). Discuss the implications for modern cryptography if it were proven that P equals NP, and describe the current consensus among mathematicians.