scientific article; zbMATH DE number 3991578
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.]
- Mathematical problems in cryptology
- Using Lucas sequences to factor large integers near group orders.
- scientific article; zbMATH DE number 3885978 (Why is no real title available?)
- Short Notes: Factoring Medium-Sized Integers
- scientific article; zbMATH DE number 4158701 (Why is no real title available?)
- scientific article; zbMATH DE number 4165009 (Why is no real title available?)
- An FFT Extension to the P - 1 Factoring Algorithm
- The quadratic sieve factoring algorithm
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Factoring Large Numbers on a Pocket Calculator
- scientific article; zbMATH DE number 4045819 (Why is no real title available?)
- scientific article; zbMATH DE number 17387 (Why is no real title available?)
- Factoring Numbers with Conway’s 150 Method
- scientific article; zbMATH DE number 1931193 (Why is no real title available?)
- On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
- scientific article; zbMATH DE number 780072 (Why is no real title available?)
- Counting the Integers Factorable via Cyclotomic Methods
- Some parallel algorithms for integer factorisation
- New ideas for factoring large integers
- Differential Factoring for Integers
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)