Pages that link to "Item:Q3748329"
From MaRDI portal
The following pages link to The Multiple Polynomial Quadratic Sieve (Q3748329):
Displaying 28 items.
- On sharp transitions in making squares (Q431647) (← links)
- Factoring: algorithms, computations, and computers (Q547500) (← links)
- A parallel version of the continued fraction integer factoring algorithm (Q547503) (← links)
- Some uses of microcomputers in number theory research (Q912884) (← links)
- Modifikationen des Pollard-Algorithmus (Q1172077) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Factoring with the quadratic sieve on large vector computers (Q1825224) (← links)
- An Implementation of the Number Field Sieve (Q2785383) (← links)
- Better polynomials for GNFS (Q2792346) (← links)
- Quadratic sieving (Q2796022) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- A Practical Analysis of the Elliptic Curve Factoring Algorithm (Q3137481) (← links)
- (Q3416682) (← links)
- Running Time Predictions for Factoring Algorithms (Q3502724) (← links)
- Cryptanalysis of RSA Using the Ratio of the Primes (Q3637134) (← links)
- Tables of Fibonacci and Lucas factorizations (Q3772275) (← links)
- Factorization beyond the googol with MPQS on a single computer (Q3979726) (← links)
- Factorization of the tenth Fermat number (Q4221993) (← links)
- Applying sieving to the computation of quadratic class groups (Q4235524) (← links)
- (Q4375601) (← links)
- New quadratic polynomials with high densities of prime values (Q4780385) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- New Cullen Primes (Q4878523) (← links)
- Factorization Using the Quadratic Sieve Algorithm (Q5019322) (← links)
- Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms (Q5202277) (← links)
- Optimal Parameterization of SNFS (Q5295345) (← links)
- On the number of semismooth integers (Q5864316) (← links)
- Smooth subsum search a heuristic for practical integer factorization (Q6660954) (← links)
