5. sep. 2014 kl. 03:23 skrev Jonathan Katz <jkatz at cs.umd.edu>: > So basically if P=NP, you are left with the one-time pad and variants. No. As long as it’s hard to factor a 2000-bit RSA composite using feasible resources for a decade, lot’s of nice cryptography is possible. -- Kristian Gjøsteen