|visits||member for||10 months|
|seen||May 8 '13 at 4:48|
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.