A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm

Carl Pomerance, J. W. Smith, Randy Tuler
1988 SIAM journal on computing (Print)  
We describe the quadratic sieve factoring algorithm and a pipeline architecture on which it could be efficiently implemented. Such a device would be of moderate cost to build and would be able to factor 100-digit numbers in less than a month. This represents an order of magnitude speed-up over current implementations on supercomputers. Using a distributed network of many such devices, it is predicted much larger numbers could be practically factored.
doi:10.1137/0217023 fatcat:qij5r72hfbckxgdgamqkvqwzme