[18885] in cryptography@c2.net mail archive
Re: RSA-640 factored
daemon@ATHENA.MIT.EDU (Simon Josefsson)
Wed Nov 9 12:41:38 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
From: Simon Josefsson <jas@extundo.com>
To: cryptography@metzdowd.com
Date: Wed, 09 Nov 2005 18:33:35 +0100
In-Reply-To: <20051109165433.GX32330@piias899.ms.com> (Victor Duchovni's
message of "Wed, 9 Nov 2005 11:54:33 -0500")
Victor Duchovni <Victor.Duchovni@MorganStanley.com> 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, not
> CPU. Inverting the matrix requires increasingly prohitive quantities
> of RAM. Read the DJB hardware GNFS proposal.
Can we deduct a complexity expression from it, that could be used to
(at least somewhat reliably) predict the cost of cracking RSA-768 or
or RSA-1024, based on the timing information given in this report?
The announcement doesn't say how much memory these machines had,
though, but perhaps that information can be disclosed.
Thanks,
Simon
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
