1994-05-11 - Re: Patents on RSA will expire soon….

Header Data

From: fnerd@smds.com (FutureNerd Steve Witham)
To: cypherpunks@toad.com
Message Hash: 1008c2df5f903d295660ae5130f3293f11ca979a5af4c4bb91423930db30c55e
Message ID: <9405111945.AA11431@smds.com>
Reply To: N/A
UTC Datetime: 1994-05-11 19:57:09 UTC
Raw Date: Wed, 11 May 94 12:57:09 PDT

Raw message

From: fnerd@smds.com (FutureNerd Steve Witham)
Date: Wed, 11 May 94 12:57:09 PDT
To: cypherpunks@toad.com
Subject: Re: Patents on RSA will expire soon....
Message-ID: <9405111945.AA11431@smds.com>
MIME-Version: 1.0
Content-Type: text/plain

> The algorithm that factored RSA129 takes about exp(sqrt((log n)(log log
> n))) steps.
> Indeed 10^17 instructions is just about how much work was required to
> factor RSA129--.
> That formula gives about 10^29 for a 1024 bit number. If computers double
> in speed every 18 months then they will be only 32 times as fast when the
> patents expire.

If that rate of speedup held long term, and no significantly better
factoring algorithms showed up, it would be 60 years until
a 1024 bit number were as easy to factor as RSA129 was this year.

- - - - - - - - - - - - - - -
and i dreamed i was flying
high up above my eyes could clearly see
the statue of liberty
sailing away to sea        --Paul Simon
Version: 2.3a