This article is concerned with the large-prime variations of the
multipolynomial quadratic sieve factorization method: the PMPQS (one
large prime) and the PPMPQS (two). We present the results of many
factorization runs with the PMPQS and PPMPQS on SGI workstations and on a Cray C90
vector computer. Experiments show that for our Cray C90
implementations PPMPQS beats PMPQS for numbers of more than 80 digits,
and that this crossover point goes down with the amount of available
central memory.
¶ For PMPQS we give a formula to predict the total running time based on
a short test run.
The accuracy of the prediction is within 10\% of the actual running time.
For PPMPQS we do not have such a formula.
Yet in order to provide measurements to help determining a good choice of
the parameters in PPMPQS, we factored many numbers.
In addition we give an experimental prediction formula for PPMPQS suitable
if one wishes to factor many large numbers of about the same size.
Publié le : 1996-05-14
Classification:
factorization,
multiple polynomial quadratic sieve,
vector supercomputer,
cluster of workstations,
11Y05
@article{1047565445,
author = {Boender, Henk and te Riele, Herman J. J.},
title = {Factoring integers with large-prime variations of the quadratic sieve},
journal = {Experiment. Math.},
volume = {5},
number = {4},
year = {1996},
pages = { 257-273},
language = {en},
url = {http://dml.mathdoc.fr/item/1047565445}
}
Boender, Henk; te Riele, Herman J. J. Factoring integers with large-prime variations of the quadratic sieve. Experiment. Math., Tome 5 (1996) no. 4, pp. 257-273. http://gdmltest.u-ga.fr/item/1047565445/