Fate of Ecash if RSA is cracked?

[Perry E. Metzger]

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