← Back to context Comment by widforss 3 days ago But, is it proven that RSA is secure? Wouldn't that also prove P != NP? 1 comment widforss Reply MattPalmer1086 3 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.
MattPalmer1086 3 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.
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.