A parallel version of the continued fraction integer factoring algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3885978 (Why is no real title available?)
- A Method of Factoring and the Factorization of F 7
- A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
- Auslander-Reiten quivers of local orders of finite lattice type
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
- On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Multiple Polynomial Quadratic Sieve
Cited in
(6)- New Factors of Fermat Numbers
- On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
- scientific article; zbMATH DE number 3885978 (Why is no real title available?)
- scientific article; zbMATH DE number 5492361 (Why is no real title available?)
- Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
- Continued fractions and parallel SQUFOF
This page was built for publication: A parallel version of the continued fraction integer factoring algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547503)
