From: "Perry E. Metzger" <perry@piermont.com>
Date: Tue, 4 Jun 1996 07:37:46 +0800
To: norm@netcom.com (Norman Hardy)
Subject: Re: Fate of Ecash if RSA is cracked?
In-Reply-To: <add8d6a4070210044ee4@DialupEudora>
Message-ID: <199606031810.OAA05553@jekyll.piermont.com>
MIME-Version: 1.0
Content-Type: text/plain



Norman Hardy writes:
> At 8:01 AM 6/3/96, Perry E. Metzger wrote:
> >Dr. Dimitri Vulis writes:
> ....
> >> This'll happen, probably sooner than later.
> >
> >Why do you assume that? There are plenty of problems that are
> >provably not solvable in non-exponential time even if P=NP. What makes
> >you think this one is going to be solved?
> 
> The "Idea Futures" forum has established odds on this. The current odds are
> currently 60% that a 1024 bit number will be factored by 2010 and 30% that
> a 512 bit number will be factored by 1997.

Thats totally different from a high speed polynomial time factoring
algorithm. Thats saying we can factor bigger numbers with
time. Exponential growth still holds, however.

.pm