Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
enth
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
2 ms
·
1.
▲
by
enth
16y ago
You're right, that statement was rather too broad. Thank you for the correction.
2.
▲
by
enth
16y 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 encr