scientific article; zbMATH DE number 3924865
[For the entire collection see Zbl 0562.00008.] This paper describes an implementation of the Quadratic Sieve (QS) Factoring technique on a Cray IS computer. Several modifications, which were made to the QS algorithm, in order to improve its running time, are briefly discussed here. The resulting computer program was tested on 10 ``most wanted factorizations taken from the Cunningham Project. All of these numbers were successfully factored and their factorizations are given in the paper. The most notable of these is the factorization of the 71 digit \((10^{71}-1)/9\), a task which took the computer 9.5 hours to perform.
- New Factors of Fermat Numbers
- New ideas for factoring large integers
- New results on some multiplicative functions
- Recent progress and prospects for integer factorisation algorithms
- On the Factorization of Integers
- scientific article; zbMATH DE number 3760250
- On the number of factorizations of an integer
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3699758)