Parallel Computers, Number Theory Problems, and Experimental Results
Lerner
Mark D.
author
Columbia University. Computer Science
Columbia University. Computer Science
originator
contributor
text
Technical reports
New York
Department of Computer Science, Columbia University
1987
This paper discusses the number theoretic problems of primality testing and factorization. It presents algorithms for these problems. and reports on six implementations. Original work is presented for three machines (DADO [Stolfo 83], the Intel Hypercube [Hypercube 86] and the Sequent Balance [Balance 86]). DADO runs primality testing and trial-divisors factorization. The Balance and Hypercube execute factorization by elliptic curves [Lenstra 86]. Work by other researchers is due to [Batcher 86, Pomerance 86, Silverman 86 and Wunderlich]; these implementations use a network of workstations, a special-purpose parallel sieve machine and the Massively Parallel Processor (MPP). The 16K1processor memory of the current DADO2 machine was too small to execute the elliptic curve program, though it was ample for trial-divisors factorization.
Computer science
Columbia University Computer Science Technical Reports
CUCS-283-87
http://hdl.handle.net/10022/AC:P:11850
English
NNC
NNC
2011-11-28 16:53:05 -0500
2011-11-28 17:11:45 -0500
5833
eng