The results are presented of experiments with the multiple polynomial version of the quadratic sieve factorization method on a CYBER 205 and on a NEC SX-2 vector computer. Various numbers in the 50–92 decimal digits range have been factorized, as a contribution to (i) the Cunningham project, (ii) Brent's table of factors of Mersenne numbers, and (iii) a proof by Brent and G. Cohen of the non-existence of odd perfect numbers below 10200. The factorized 92-decimal digits number is a record for general purpose factorization methods.

Additional Metadata
Keywords Quadratic sieve factorization, vector computer
Persistent URL dx.doi.org/10.1016/B978-0-444-88621-7.50018-9
Series Advances in Parallel Computing
Citation
te Riele, H.J.J, Lioen, W.M, & Winter, D.T. (1990). Factoring with the quadratic sieve on large vector computers. Advances in Parallel Computing. doi:10.1016/B978-0-444-88621-7.50018-9