Amongst other things, that public key cryptography is crackable in polynomial time, rendering it effectively useless if a generalisable algorithm (such as prese

Amongst other things, that public key cryptography is crackable in polynomial time, rendering it effectively useless if a generalisable algorithm (such as presented in the paper) is able to convert a non-polynomial time algorithm into a polynomial time one. http://en.wikipedia.org/wiki/P_versus_NP_problem#Consequences_of_the_resolution_of_the_problem http://en.wikipedia.org/wiki/P_versus_NP_problem#Consequence... has better details than I can give.