Y
Hacker News
new
|
ask
|
show
|
jobs
by
widforss
307 days ago
But, is it proven that RSA is secure? Wouldn't that also prove P != NP?
1 comments
MattPalmer1086
307 days ago
Haha, well it does depend on the assumption that integer factorisation is hard. Although I'm not sure that being able to do it implies P = NP.
link