[107805] in Cypherpunks
CDR: A digital way to filter...
daemon@ATHENA.MIT.EDU (Jim Choate)
Sun Jan 24 15:58:57 1999
From: Jim Choate <ravage@EINSTEIN.ssz.com>
To: cypherpunks@EINSTEIN.ssz.com
Date: Sun, 24 Jan 1999 14:46:29 -0600 (CST)
Reply-To: Jim Choate <ravage@EINSTEIN.ssz.com>
Hi,
One possible way would be to create an array of counters whose stages map to
the primes. Then feed it a pulse train of n pulses. If none of the counters
end up with any remainder then the number should be prime.
This should be doable in standard FPGA's and such. This should be a
reasonably fast way to factor numbers. We only need to prove we know all the
primes, k, less than n. With k counters set to those primes we should be
able to factor n in at most n clock cycles.
A linear factoring algorithm?
____________________________________________________________________
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 --'-
--------------------------------------------------------------------
