> a lot of cryptography will ultimately fail if we discover that P = NP. This is conjectured, but can you prove it? When the degree of the polynomial of the mi

> a lot of cryptography will ultimately fail if we discover that P = NP. This is conjectured, but can you prove it? When the degree of the polynomial of the minimal running time or its coefficients gets large, one can imagine a world where e.g. asymmetric cryptography, as we understand it today, it still possible.