enth
Re:A message from Comodo Hacker
on Monday March 28, 2011 @01:29PM (#2379190)
You're right, that statement was rather too broad. Thank you for the correction.
Re:A message from Comodo Hacker
on Sunday March 27, 2011 @11:13PM (#2376977)
No. Integer factorization is not NP-hard (so not NP-complete). (This isn't proven, but it's generally thought to be the case.) So, while doing a polynomial-time integer factorization would be hugely significant (and make all asymmetric encryption in the world useless), it would not prove P=NP.