The Quadratic Sieve Factoring Algorithm

The Quadratic Sieve Factoring Algorithm (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Eric Landquist

Citations:

1 - 0 self

BibTeX

@MISC{Landquist01thequadratic,
    author = {Eric Landquist},
    title = {The Quadratic Sieve Factoring Algorithm},
    year = {2001}
}

Bookmark

OpenURL

Abstract

Mathematicians have been attempting to find better and faster ways to factor composite numbers since the beginning of time. Initially this involved dividing a number by larger and larger primes until you had the factorization. This trial division was not improved upon until Fermat applied the

Citations

143	Solving sparse linear equations over finite fields - Wiedemann - 1986
34	Factorization and Primality Testing - Bressoud - 1989
18	Prime Numbers and Computer Methods for Factorization (2nd - Riesel - 1994
10	Number theory with computer applications - Kumanduri, Romero - 1998
5	Factoring large numbers with a quadratic sieve - Gerver - 1983
3	et al. Factorization of a 512-bit RSA Modulus. Eurocrypt - Cavallar - 2000
2	Cryptology and Computational Number Theory; Factoring. AMS - Pomerance - 1990
2	Number Theory for Computing - Song - 2000
2	Algebra Methods in Cryptography,” unpublished paper - Webster - 2001
1	What’s Happening in hte - Cipra - 1996
1	The Multiple Polynomial Quadratic Sieve Method - Silverman - 1987