FACTORING HARD INTEGERS ON A PARALLEL MACHINE

Authors
PERALTA R MAMBO M OKAMOTO E
Citation
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
Journal title
IEICE transactions on fundamentals of electronics, communications and computer science → ACNP
ISSN journal
09168508
Volume
E80A
Issue
4
Year of publication
1997
Pages
658 - 662
Database
ISI
SICI code
0916-8508(1997)E80A:4<658:FHIOAP>2.0.ZU;2-Y
Abstract
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.