143 reputation
3
bio website
location
age
visits member for 1 year, 5 months
seen Apr 23 at 22:13

May
6
awarded  Scholar
May
6
awarded  Supporter
May
6
accepted RSA leak bits to factor N
May
6
comment RSA leak bits to factor N
Ah I see! Thanks for pointing out that paper. Seems like a very good summary of what you can do with RSA. It appears that $n/4$ (or $k/2$ for $k$ bit $p,q$) is the best bound out there then.
May
6
awarded  Student
May
6
asked RSA leak bits to factor N