The Multiple Polynomial Quadratic Sieve
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1113829
- scientific article; zbMATH DE number 1444326
- scientific article; zbMATH DE number 3959521
- Quadratic sieving
- scientific article; zbMATH DE number 908568
- Polynomial Selection for the Number Field Sieve
- The polynomial sieve and equal sums of like polynomials
- scientific article; zbMATH DE number 708815
- Factorization using the quadratic sieve algorithm
- Root optimization of polynomials in the number field sieve
Cited in
(43)- Modifikationen des Pollard-Algorithmus
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- Factoring with the quadratic sieve on large vector computers
- scientific article; zbMATH DE number 1696618 (Why is no real title available?)
- Better polynomials for GNFS
- Quadratic sieving
- The Factorization of the Ninth Fermat Number
- A Practical Analysis of the Elliptic Curve Factoring Algorithm
- scientific article; zbMATH DE number 3857198 (Why is no real title available?)
- scientific article; zbMATH DE number 5117572 (Why is no real title available?)
- An FFT Extension to the P - 1 Factoring Algorithm
- Running Time Predictions for Factoring Algorithms
- Cryptanalysis of RSA Using the Ratio of the Primes
- scientific article; zbMATH DE number 3959521 (Why is no real title available?)
- scientific article; zbMATH DE number 3970826 (Why is no real title available?)
- Tables of Fibonacci and Lucas factorizations
- scientific article; zbMATH DE number 20453 (Why is no real title available?)
- Factorization of the tenth Fermat number
- Applying sieving to the computation of quadratic class groups
- scientific article; zbMATH DE number 554529 (Why is no real title available?)
- On sharp transitions in making squares
- Factoring with Two Large Primes
- scientific article; zbMATH DE number 708815 (Why is no real title available?)
- scientific article; zbMATH DE number 1024101 (Why is no real title available?)
- Factoring Integers with Large-Prime Variations of the Quadratic Sieve
- scientific article; zbMATH DE number 1088933 (Why is no real title available?)
- scientific article; zbMATH DE number 1113829 (Why is no real title available?)
- On a strategy in the sieving procedure for the factorization of large natural numbers
- On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
- 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
- New Cullen Primes
- scientific article; zbMATH DE number 1394326 (Why is no real title available?)
- Factorization using the quadratic sieve algorithm
- Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
- Optimal Parameterization of SNFS
- Improved Stage 2 to P ± 1 Factoring Algorithms
- Square form factorization
- Factoring: algorithms, computations, and computers
- A parallel version of the continued fraction integer factoring algorithm
- On the number of semismooth integers
- Smooth subsum search a heuristic for practical integer factorization
- Some uses of microcomputers in number theory research
This page was built for publication: The Multiple Polynomial Quadratic Sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748329)
