论文信息 - Achieving Superlinear Speedups for the Multiple Polynomial Quadratic Sieve Factoring Algorithm on a Distributed Memory Multiprocessor

Achieving Superlinear Speedups for the Multiple Polynomial Quadratic Sieve Factoring Algorithm on a Distributed Memory Multiprocessor

We first study the parallelization of the MPQS factoring algorithm for a distributed memory multiprocessor. We then propose a solution ensuring no communications during the sieve phase through a new distribution strategy of the polynomials. We derive an implementation on the FPS T40 hypercube. We compare various distribution strategy and show how we can achieve superlinear speedups.

Michel Cosnard | Jean-Laurent Philippe

[1] J. Gerver. Factoring large numbers with a quadratic sieve , 1983 .

[2] Carl Pomerance,et al. The Quadratic Sieve Factoring Algorithm , 1985, EUROCRYPT.

[3] Michel Cosnard,et al. Gaussian Elimination on Message Passing Architecture , 1987, ICS.

[4] Dik Winter,et al. Factoring with the quadratic sieve on large vector computers , 1989 .

[5] Arjen K. Lenstra,et al. Factoring by Electronic Mail , 1990, EUROCRYPT.

[6] É. Lucas,et al. Théorie des nombres , 1961 .

[7] Robert D. Silverman. The multiple polynomial quadratic sieve , 1987 .

[8] Marvin C. Wunderlich,et al. A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers , 1984, Parallel Comput..

[9] Jeffrey W. Smith,et al. A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm , 1988, SIAM J. Comput..

[10] Douglas H. Wiedemann. Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[11] James A. Davis,et al. Factorization of Large Integers on a Massively Parallel Computer , 1988, EUROCRYPT.

[12] Jean-Louis Roch. Calcul formel et parallélisme : l'architecture du système PAC et son arithmétique rationnelle. (Computer algebra and parallelism: pac system architecture and rationnal arithmetic) , 1989 .