Smooth subsum search a heuristic for practical integer factorization
From MaRDI portal
Cites work
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- A babystep-giantstep method for faster deterministic integer factorization
- A Method of Factoring and the Factorization of F 7
- A tale of two sieves.
- A time-space tradeoff for Lehman's deterministic integer factorization method
- An exponent one-fifth algorithm for deterministic integer factorisation
- Asymptotically Fast Factorization of Integers
- Factoring Integers with Large-Prime Variations of the Quadratic Sieve
- Factoring polynomials with rational coefficients
- Finding a small root of a univariate modular equation
- scientific article; zbMATH DE number 3801619 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- Improved low-density subset sum algorithms
- Integer factoring
- Integer factorization as subset-sum problem
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- New generic algorithms for hard knapsacks
- Prime numbers and computer methods for factorization.
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Solving linear equations modulo unknown divisors: revisited
- The development of the number field sieve
- The joy of factoring
- The Multiple Polynomial Quadratic Sieve
- Using LLL-reduction for solving RSA and factorization problems
This page was built for publication: Smooth subsum search a heuristic for practical integer factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660954)
