Factoring Large Numbers with a Quadratic Sieve
Open Access
- 1 July 1983
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 41 (163) , 287-294
- https://doi.org/10.2307/2007781
Abstract
The quadratic sieve algorithm was used to factor a 47-digit number into primes. A comparison with Wagstaff's results using the continued fraction early abort algorithm suggests that QS should be faster than CFEA when the number being factored exceeds 60 digits (plus or minus ten or more digits, depending on details of the hardware and software).Keywords
This publication has 4 references indexed in Scilit:
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Asymptotically Fast Factorization of IntegersMathematics of Computation, 1981
- A running time analysis of Brillhart's continued fraction factoring methodPublished by Springer Nature ,1979