NODE de5c19fcRSA129
Black Unicorn <unicorn@schloss.li>Sat, 27 Apr 1996 14:51:51 +0800
At one point someone asked about how the breaking of RSA129 might impact
on the calculation of MIPSyears to crack a 512 bit RSA key (i.e. a PGP 512
bit key).
Was there ever an answer to this question?
Are there current guesses for 1024 and 512 bit keys out there?
---
My preferred and soon to be permanent e-mail address:unicorn@schloss.li
"In fact, had Bancroft not existed, potestas scientiae in usu est
Franklin might have had to invent him." in nihilum nil posse reverti
00B9289C28DC0E55 E16D5378B81E1C96 - Finger for Current Key Information
Opp. Counsel: For all your expert testimony needs: jimbell@pacifier.com
NODE ea0d7d4dfactoring estimates
Wei Dai <weidai@eskimo.com>Sat, 27 Apr 1996 16:01:44 +0800
On Fri, 26 Apr 1996, Black Unicorn wrote:
> Are there current guesses for 1024 and 512 bit keys out there?
The best estimates from before the break of RSA130 is (see The Future of
Integer Factorization by Andrew M. Odlyzko):
bits MY required log base 2 of total instructions
428 1000 55
512 3*10^4 60
1024 3*10^11 83
2048 3*10^20 113
The factoring of RSA130 proved that a 432 bit number takes only
500 MIPS-years. Therefore the above estimates should be divided by 2:
432 500 54
512 1.5*10^4 59
1024 1.5*10^11 82
2048 1.5*10^20 112
Wei Dai