Comment by pigeons Comment by pigeons 2 days ago 1 reply Copy Link View on Hacker News > I remember being given a proof of why RSA encryption is secureWith what assumptions?
Copy Link MattPalmer1086 2 days ago Collapse Comment - Mostly just integer factorisation of large numbers is hard.There are some other things you have to worry about practically, e.g Coppersmith's attack, and padding schemes (although that wasn't part of the proof I was given) Reply View | 0 replies
Mostly just integer factorisation of large numbers is hard.
There are some other things you have to worry about practically, e.g Coppersmith's attack, and padding schemes (although that wasn't part of the proof I was given)