A pipeline architecture for factoring large integers with the quadratic sieve algorithm

Journal Article · Thu Mar 31 23:00:00 EST 1988 · SIAM J. Comput.; (United States)

DOI:https://doi.org/10.1137/0217023· OSTI ID:6984893

Pomerance, C; Smith, J W; Tuler, R

The authors 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.

• Research Organization: Dept. of Mathematics, Univ. of Georgia, Athens, GA (US)
• OSTI ID: 6984893
• Journal Information: SIAM J. Comput.; (United States), Journal Name: SIAM J. Comput.; (United States) Vol. 17:2; ISSN SMJCA
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
COMPUTER ARCHITECTURE
COMPUTER CALCULATIONS
COMPUTER NETWORKS
DATA-FLOW PROCESSING
MATHEMATICAL LOGIC
PROGRAMMING