Comment Re:This will NOT break all encryption algorithms.. (Score 1) 318
Not to bust anyone's bubble, but the factoring problem is actually not known to be NP completely and evidence points to the fact that it is no, since if it could be shown to be then this would prove that NP=Co-NP. Similarly, the discrete logarithm problem is also not known to be NP-complete. Therefore, public key cryptosystems should be fine.
TL;DR - No encryption schemes will be broken if it is proved that P=NP.
You got that wrong. If P=NP, then NP=Co-NP, so your public key cryptosystems are broken. (Also, if P=NP, all problems in P are NP complete)