A parallel version of the continued fraction integer factoring algorithm

DOI10.1007/BF00128047zbMath1215.65212OpenAlexW2081211112MaRDI QIDQ547503

Hugh C. Williams, Marvin Wunderlich

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

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical algorithms for computer arithmetic, etc. (65Y04)

Uses Software

• CFRAC

Cites Work

• Unnamed Item
• 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
• The Multiple Polynomial Quadratic Sieve
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• A Method of Factoring and the Factorization of F 7
• On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm

This page was built for publication: A parallel version of the continued fraction integer factoring algorithm