scientific article; zbMATH DE number 17387

From MaRDI portal
Publication:3974092





[For the entire collection see Zbl 0722.00005.] This paper extensively discusses the two fastest known practical factoring methods, viz., the quadratic sieve (qs) method of Kraitchek and Pomerance, and the elliptic curve (ecm) method of H. W. Lenstra, Jr. A final section gives valuable historical notes (in particular, proper credit is given to Morrison and Brillhart for their share in the development of the basic quadratic sieve factoring method), and describes some recent implementations of qs and ecm. \{Two additional references: \textit{H. J. J. te Riele}, \textit{W. M. Lioen} and \textit{D. T. Winter}, Factoring with the quadratic sieve on large vector computers, J. Comput. Appl. Math. 27, 267-278 (1989; Zbl 0684.10005) and (by the same authors) Factorization beyond the googol with \(MPQS\) on a single computer, CWI Q. 4, 69-72 (1991; see the following review). These two papers describe experiences with qs on super (vector-) computers.\}.











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 Q3974092)