|visits||member for||1 year, 6 months|
|seen||Apr 23 at 22:13|
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.