[10773] in cryptography@c2.net mail archive
Re: objectivity and factoring analysis
daemon@ATHENA.MIT.EDU (bear)
Mon May 13 14:31:08 2002
Date: Mon, 13 May 2002 09:45:49 -0700 (PDT)
From: bear <bear@sonic.net>
To: Anonymous <nobody@remailer.privacy.at>
Cc: cryptography@wasabisystems.com
In-Reply-To: <b93a59a622814155eeedc9e346b6602f@remailer.privacy.at>
Message-ID: <Pine.LNX.4.40.0205130943540.5126-100000@newbolt.sonic.net>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
On Fri, 26 Apr 2002, Anonymous wrote:
>These estimates are very helpful. Thanks for providing them. It seems
>that, based on the factor base size derived from Bernstein's asymptotic
>estimates, the machine is not feasible and would take thousands of years
>to solve a matrix. If the 50 times smaller factor base can be used,
>the machine is on the edge of feasibility but it appears that it would
>still take years to factor a single value.
One thousand years = 10 iterations of Moore's law plus one year.
Call it 15-16 years? Or maybe 20-21 since Moore's seems to have
gotten slower lately?
Bear
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
