top | item 44977915 (no title) widforss | 6 months ago But, is it proven that RSA is secure? Wouldn't that also prove P != NP? discuss order hn newest MattPalmer1086|6 months 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|6 months 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|6 months ago