objectivity and factoring analysis
bear
bear at sonic.net
Mon May 13 12:45:49 EDT 2002
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 at wasabisystems.com
More information about the cryptography
mailing list