cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1996-06-04 - Re: Fate of Ecash if RSA is cracked?

Header Data

From: “Perry E. Metzger” <perry@piermont.com>
To: ichudov@algebra.com (Igor Chudov)
Message Hash: 14b8c45f46a9ec0e176b2f80c2a9c1c04757853082c9d45cfe705fcc71a2ef70
Message ID: <199606041254.IAA08918@jekyll.piermont.com>
Reply To: <199606040508.AAA01035@manifold.algebra.com>
UTC Datetime: 1996-06-04 18:21:19 UTC
Raw Date: Wed, 5 Jun 1996 02:21:19 +0800

Raw message

From: "Perry E. Metzger" <perry@piermont.com>
Date: Wed, 5 Jun 1996 02:21:19 +0800
To: ichudov@algebra.com (Igor Chudov)
Subject: Re: Fate of Ecash if RSA is cracked?
In-Reply-To: <199606040508.AAA01035@manifold.algebra.com>
Message-ID: <199606041254.IAA08918@jekyll.piermont.com>
MIME-Version: 1.0
Content-Type: text/plain



Igor Chudov @ home writes:
> Actually factoring is not exponential even now. For Number Fiels Sieve 
> method the number of operations is estimated as
> 
> N ~= exp(((1.923+O(1)) * (ln n)^(1/3) * ln ln n)^(2/3))
> 
> (taken from Schneier, A.C., page 256)

The distinction between that and exponential is rather difficult for
most ordinary people to see, and in any case subexponential and
exponential are "practically the same" for purposes of this
discussion.

.pm

Thread