Optimization of the MPQS-factoring algorithm on the Cyber 205 and on the NEC SX-2
Walter M. Lioen, H.J.J. teRiele, D.T. Winter · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1988
This paper describes the optimization of a program for the factorization of large integers on two large vector processors: a CDC Cyber 205 and a NEC SX-2.The factoring method used is the so-called multiple polynomial version of the quadratic Sle'le algorithm.Several large integers in the 48-92 decimal digits range have actually been factorized with these two programs.The largest number, the 92-digit composlte (6 131 -1)1(52633931•6551), was factorized in about 95 CPU-hours on the NEC SX-2.This result means a new absolute record for general purpose factoring methods.