Quadratic sieve

Known as: MPQS, Multipolynomial quadratic sieve, QS 
The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second fastest method known (after the general number… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
This article gives a gentle introduction to factoring large integers via the quadratic sieve algorithm. The conjectured… (More)
Is this relevant?
2002
2002
The quadrat ic sieve algori thm i s cur ren t ly t h e method of choice t o f a c t o r very l a r g e composite numbers wi th no… (More)
Is this relevant?
2000
2000
Integer factorization is a well studied topic. Parts of the cryptography we use each day rely on the fact that this problem is di… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1997
1997
In 1996, we used the self initializing quadratic sieve (siqs) to set the general purpose integer factorization record for the… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
I t is the best of times for the game of factoring large numbers into their prime factors. In 1970 it was barely possible to… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
In 1990, the ninth Fermat number was factored into primes by means of a new algorithm, the "number field sieve", which was… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The number field sieve is an algorithm to factor integers of the form r e ± s for small positive r and s . This note is intended… (More)
Is this relevant?
1988
1988
A new version of the Quadratic Sieve algorithm, used for factoring large integers, has recently emerged. The new algorithm… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A modification, due to Peter Montgomery, of Pomerance's Quadratic Sieve for factoring large integers is discussed along with its… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1983
1983
The quadratic sieve algorithm was used to factor a 47-digit number into primes. A comparison with Wagstaff's results using the… (More)
Is this relevant?