[10750] in cryptography@c2.net mail archive
Re: Lucky's 1024-bit post [was: RE: objectivity and factoring analysis]
daemon@ATHENA.MIT.EDU (Wei Dai)
Sun May 12 21:59:46 2002
Date: Mon, 29 Apr 2002 10:31:34 -0700
From: Wei Dai <weidai@eskimo.com>
To: Lucky Green <shamrock@cypherpunks.to>
Cc: cryptography@wasabisystems.com
Message-ID: <20020429103132.A22765@eskimo.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
In-Reply-To: <20020424123025.C25053@eskimo.com>; from weidai@eskimo.com on Wed, Apr 24, 2002 at 12:30:26PM -0700
Sorry, there's a mistake in my post, which makes the relationship finding
phase look easier than it actually is. BTW, why did it take 5 days for
that post to go through?
On Wed, Apr 24, 2002 at 12:30:26PM -0700, Wei Dai wrote:
> Using a factor base size of 10^9, in the relationship finding phase you
> would have to check the smoothness of 2^89 numbers, each around 46 bits
> long.
Obviously there are not 2^89 integers that are 46 bits long. Each of the
numbers that need to be checked for smoothness is actually around 195 bits
long.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
