http://mathworld.wolfram.com/news/2005-11-08/rsa-640/
--Steven M. Bellovin, http://www.cs.columbia.edu/~smb
-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]
From:
http://mathworld.wolfram.com/news/2005-11-08/rsa-640
November 8, 2005--A team at the German Federal Agency
for Information Technology Security (BSI) recently
announced the factorization of the 193-digit number
310 7418240490 0437213507 5003588856 7930037346
Steven M. Bellovin [EMAIL PROTECTED] writes:
http://mathworld.wolfram.com/news/2005-11-08/rsa-640/
There are timing details in:
http://www.crypto-world.com/announcements/rsa640.txt
They claim they need 5 months of 80 machines with 2.2GHz processors.
Using these numbers, I think it would be
On Wed, Nov 09, 2005 at 05:27:12PM +0100, Simon Josefsson wrote:
I'm not sure translating complexity into running time is reasonable,
but pending other ideas, this is a first sketch.
It is not reasonable, because the biggest constraint is memory, not
CPU. Inverting the matrix requires
Victor Duchovni [EMAIL PROTECTED] writes:
On Wed, Nov 09, 2005 at 05:27:12PM +0100, Simon Josefsson wrote:
I'm not sure translating complexity into running time is reasonable,
but pending other ideas, this is a first sketch.
It is not reasonable, because the biggest constraint is memory,
