[107844] in Cypherpunks
CDR: Expansion of the register approach to factoring
daemon@ATHENA.MIT.EDU (Jim Choate)
Mon Jan 25 20:04:46 1999
From: Jim Choate <ravage@EINSTEIN.ssz.com>
To: cypherpunks@EINSTEIN.ssz.com
Date: Mon, 25 Jan 1999 18:33:14 -0600 (CST)
Reply-To: Jim Choate <ravage@EINSTEIN.ssz.com>
Hi,
The actual equation that describes the scaling of the digital
register-counter approach is:
n * log (n)
2
-----------
ln(n)
The number of bits per register is log (n)
2
The absolute upper limit of the required registers is given by x/ln(x)
x=n
____________________________________________________________________
What raises the standard of living may well diminish the
quality of life.
The Club of Rome
The Armadillo Group ,::////;::-. James Choate
Austin, Tx /:'///// ``::>/|/ ravage@ssz.com
www.ssz.com .', |||| `/( e\ 512-451-7087
-====~~mm-'`-```-mm --'-
--------------------------------------------------------------------
