Factorization using the quadratic sieve algorithm
From MaRDI portal
Recommendations
Cites work
- A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
- A Method of Factoring and the Factorization of F 7
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3491031 (Why is no real title available?)
- scientific article; zbMATH DE number 3801619 (Why is no real title available?)
- scientific article; zbMATH DE number 3336748 (Why is no real title available?)
Cited in
(15)- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- Factoring with the quadratic sieve on large vector computers
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- scientific article; zbMATH DE number 3950601 (Why is no real title available?)
- scientific article; zbMATH DE number 3959521 (Why is no real title available?)
- The Multiple Polynomial Quadratic Sieve
- A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
- scientific article; zbMATH DE number 475434 (Why is no real title available?)
- scientific article; zbMATH DE number 708815 (Why is no real title available?)
- scientific article; zbMATH DE number 1024054 (Why is no real title available?)
- scientific article; zbMATH DE number 1024101 (Why is no real title available?)
- scientific article; zbMATH DE number 2162228 (Why is no real title available?)
- New ideas for factoring large integers
- scientific article; zbMATH DE number 2230939 (Why is no real title available?)
- Factoring as a service
This page was built for publication: Factorization using the quadratic sieve algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019322)