A parallel version of the continued fraction integer factoring algorithm
From MaRDI portal
Publication:547503
DOI10.1007/BF00128047zbMATH Open1215.65212OpenAlexW2081211112MaRDI QIDQ547503FDOQ547503
Authors: Marvin Wunderlich, Hugh C. Williams
Publication date: 2 July 2011
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00128047
Recommendations
Cites Work
- Title not available (Why is that?)
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Multiple Polynomial Quadratic Sieve
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Auslander-Reiten quivers of local orders of finite lattice type
- Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
- A Method of Factoring and the Factorization of F 7
- On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
- A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
Cited In (6)
- Continued fractions and parallel SQUFOF
- New Factors of Fermat Numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
- On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
Uses Software
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)