scientific article; zbMATH DE number 3991578

From MaRDI portal
Publication:3754041





This is a good survey on factoring and primality testing with many interesting comments. Sections 2 and 3 describe two of the fastest general integer factoring algorithms, the continued fraction method and the quadratic sieve method. These are the two algorithms we considered in 1981 when we made our plans to build the first special processor for factoring large integers. In section 4 we present this processor, which uses the continued fraction algorithm, and mention another processor now being designed to factor numbers via the quadratic sieve algorithm. Section 6 describes Lenstra's elliptic curve algorithm. As a prelude to his method, in Section 5 we discuss briefly Pollar's p-1 algorithm, which is older but closely related to Lenstra's method. Section 7 summarizes the running times of the four factoring algorithms. Section 8 describes a special computer for the elliptic curve method. (From the introduction.) [For the entire collection see Zbl 0605.00005.]











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