Factoring: algorithms, computations, and computers
From MaRDI portal
Publication:547500
DOI10.1007/BF00128046zbMath1215.65209MaRDI QIDQ547500
Publication date: 2 July 2011
Published in: The Journal of Supercomputing (Search for Journal in Brave)
68M07: Mathematical problems of computer architecture
65Y04: Numerical algorithms for computer arithmetic, etc.
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continued fractions and number-theoretic computations
- The arithmetic of elliptic curves
- Factoring Large Numbers with a Quadratic Sieve
- Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
- Factorization and Primality Tests
- A Monte Carlo Factoring Algorithm With Linear Storage
- Modular Multiplication Without Trial Division
- Solving sparse linear equations over finite fields
- The Multiple Polynomial Quadratic Sieve
- The factorization of 𝐹₇
- A Method of Factoring and the Factorization of F 7
- A monte carlo method for factorization
- Small Class Numbers and Extreme Values of L-Functions of Quadratic Fields