A message from Comodo Hacker 15 years ago
You're right, that statement was rather too broad. Thank you for the correction.
HN user
enth
4 karma
Posts0
Comments2
No posts found.
A message from Comodo Hacker 15 years ago
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.