Corpus ID: 51756558

Factoring Integers with the Self-Initializing Quadratic Sieve

@inproceedings{Contini1997FactoringIW,
  title={Factoring Integers with the Self-Initializing Quadratic Sieve},
  author={S. Contini},
  year={1997}
}

• S. Contini
• Published 1997
• Mathematics

In 1996, we used the self initializing quadratic sieve (siqs) to set the general purpose integer factorization record for the Cunningham project. Here, we show that this algorithm is about twice as fast as the ordinary multiple polynomial quadratic sieve (mpqs). We give running times of both algorithms for 60, 70, and 80 digit numbers. These tables show the best timings we were able to get using various parameters for each of algorithms. In all cases, the best siqs times are about twice as fast… Expand

crypto-world.com

Save to Library

Create Alert

Cite

Launch Research Feed