Hacker News Reader

They only tested with numbers size of ~2^800, which is around 240 digits, but I believe (correct me if I'm wrong) there exists usages of RSA with over 600 digits, so it'll still take a massively long amount of time to factor those numbers...

View on HN

It's worth noting that numbers of this size are already being factored with existing techniques. RSA-250, a 250 digit (829 binary digit) product of two primes was factored pretty recently: https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/202...

Moreover, a 768 bit product was factored over 11 years ago, though it took two years to compute! https://en.wikipedia.org/wiki/RSA_Factoring_Challenge

Typical key lengths for RSA these days are 2048 and 4096 bits.

I don't know what that means for this paper, just happened to have those two key lengths off the top of my head.

So, 616 and 1233 digits, respectively.

Jinx! :-)

lol. Oops. At least glad I didn't screw up the math.

You do have to remember to round up, since if log_b(n) = x.y then n still requires at least (x+1) digits to describe in base-b.

2048 bits ~ 617 decimal digits, 4096 bits ~ 1234 digits.

Reply on news.ycombinator.com