The Multiple Polynomial Quadratic Sieve
From MaRDI portal
Publication:3748329
DOI10.2307/2007894zbMath0608.10004OpenAlexW4233641459MaRDI QIDQ3748329
Publication date: 1987
Full work available at URL: https://doi.org/10.2307/2007894
Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Factorization (11Y05)
Related Items (20)
New quadratic polynomials with high densities of prime values ⋮ Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ Optimal Parameterization of SNFS ⋮ Running Time Predictions for Factoring Algorithms ⋮ Tables of Fibonacci and Lucas factorizations ⋮ On sharp transitions in making squares ⋮ Some uses of microcomputers in number theory research ⋮ A Practical Analysis of the Elliptic Curve Factoring Algorithm ⋮ Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ The Factorization of the Ninth Fermat Number ⋮ Factoring: algorithms, computations, and computers ⋮ A parallel version of the continued fraction integer factoring algorithm ⋮ Better polynomials for GNFS ⋮ Quadratic sieving ⋮ New Cullen Primes ⋮ Cryptanalysis of RSA Using the Ratio of the Primes ⋮ Factoring with the quadratic sieve on large vector computers ⋮ Factorization of the tenth Fermat number ⋮ On the number of semismooth integers ⋮ Applying sieving to the computation of quadratic class groups
This page was built for publication: The Multiple Polynomial Quadratic Sieve
