← Back to context Comment by pigeons 2 days ago > I remember being given a proof of why RSA encryption is secureWith what assumptions? 1 comment pigeons Reply MattPalmer1086 2 days ago 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)
MattPalmer1086 2 days ago 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)
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)