R. Peralta et al., FACTORING HARD INTEGERS ON A PARALLEL MACHINE, IEICE transactions on fundamentals of electronics, communications and computer science, E80A(4), 1997, pp. 658-662
Citations number
10
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture","Computer Science Information Systems
We describe our implementation of the Hypercube variation of the Multi
ple Polynomial Quadratic Sieve (HMPQS) integer factorization algorithm
on a Parsytec GC computer with 128 processors. HMPQS is a variation o
n the Quadratic Sieve (QS) algorithm which inspects many quadratic pol
ynomials looking for quadratic residues with small prime factors. The
polynomials are organized as the nodes of an n-dimensional cube. We re
port on the performance of our implementations on factoring several la
rge numbers for the Cunningham Project.