News for hackers. Stuff that matters.
Re:P≠NP proof update by eru on Sunday August 15, 2010 @09:52PM (#1606537)
By the way, prime factoring is not proven to be NP-complete. So it could turn out that prime factoring is in P, without implying P=NP.

Other cryptography schemes would still remain viable, even if RSA broke down. (As long as nobody proves P=NP.)

Re:P≠NP proof update by eru on Monday August 16, 2010 @02:51AM (#1607066)
By the way, it seems highly unlikely that prime-factoring NP-complete, since it is in co-NP.