Factoring Integers with Large-Prime Variations of the Quadratic Sieve
From MaRDI portal
Publication:4347264
The authors present their work on the one and two large prime variants of the multiple polynomial quadratic sieve algorithm for factoring integers. Perhaps the most important contribution of this paper is its study of algorithm crossover points, running time predictions, and algorithm parameter choices. The introduction and description of the quadratic sieve factoring algorithm are also well done, and they present the data on over 80 factorizations of integers ranging from 66 to 88 decimal digits in size.
Recommendations
Cites work
- A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
- A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
- An algorithm for finding a fundamental set of cycles of a graph
- Factoring with the quadratic sieve on large vector computers
- scientific article; zbMATH DE number 44444 (Why is no real title available?)
- On factoring large numbers
- Prime numbers and computer methods for factorization
- The development of the number field sieve
Cited in
(19)- Integer factorization as subset-sum problem
- Factoring N=p^rq^s for Large r and s
- Factoring integers by CVP algorithms
- Factorization of Square-Free Integers with High Bits Known
- scientific article; zbMATH DE number 4132248 (Why is no real title available?)
- Smooth numbers and the quadratic sieve
- scientific article; zbMATH DE number 3970826 (Why is no real title available?)
- scientific article; zbMATH DE number 4045819 (Why is no real title available?)
- A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
- scientific article; zbMATH DE number 177024 (Why is no real title available?)
- Factorization of the tenth Fermat number
- scientific article; zbMATH DE number 475434 (Why is no real title available?)
- Factoring with Two Large Primes
- On a strategy in the sieving procedure for the factorization of large natural numbers
- scientific article; zbMATH DE number 2086904 (Why is no real title available?)
- Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
- Aliquot Sequence 3630 Ends After Reaching 100 Digits
- Smooth subsum search a heuristic for practical integer factorization
- Sieving by large prime factors
This page was built for publication: Factoring Integers with Large-Prime Variations of the Quadratic Sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347264)
