Comment by widforss Comment by widforss 3 days ago 1 reply Copy Link View on Hacker News But, is it proven that RSA is secure? Wouldn't that also prove P != NP?
Copy Link MattPalmer1086 3 days ago Collapse Comment - 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. Reply View | 0 replies
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.