A Rigorous Time Bound for Factoring Integers
From MaRDI portal
Recommendations
Cites work
- A bound for the least prime ideal in the Chebotarev density theorem
- A Monte Carlo Factoring Algorithm With Linear Storage
- A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- An asymptotic formula for the Bergman projection on a certain class of domains in \({\mathbb{C}}\)
- Asymptotically Fast Factorization of Integers
- Factoring integers with elliptic curves
- Fast Multiple-Precision Evaluation of Elementary Functions
- Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
- scientific article; zbMATH DE number 4077312 (Why is no real title available?)
- scientific article; zbMATH DE number 4095549 (Why is no real title available?)
- scientific article; zbMATH DE number 3708485 (Why is no real title available?)
- scientific article; zbMATH DE number 3782908 (Why is no real title available?)
- scientific article; zbMATH DE number 3489188 (Why is no real title available?)
- scientific article; zbMATH DE number 3563269 (Why is no real title available?)
- scientific article; zbMATH DE number 475434 (Why is no real title available?)
- scientific article; zbMATH DE number 1142300 (Why is no real title available?)
- scientific article; zbMATH DE number 3335234 (Why is no real title available?)
- Modifications to the number field sieve
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On distinguishing prime numbers from composite numbers
- On the distribution in short intervals of integers having no large prime factor
- Solving sparse linear equations over finite fields
- The Factorization of the Ninth Fermat Number
- The NP-completeness column: An ongoing guide
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
Cited in
(50)- Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel
- Rigorous analysis of a randomised number field sieve
- Approximating rings of integers in number fields
- Factoring with hints
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- On the distribution of balanced subgroups
- Explicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting)
- A deterministic algorithm for integer factorization
- The distribution of solutions to XN=N a with an application to factoring integers
- A one line factoring algorithm
- On the distribution of running times of certain integer factoring algorithms
- scientific article; zbMATH DE number 4132248 (Why is no real title available?)
- A p-adic algorithm to compute the Hilbert class polynomial
- The Factorization of the Ninth Fermat Number
- A babystep-giantstep method for faster deterministic integer factorization
- Finding elliptic curves with a subgroup of prescribed size
- Evaluating Igusa functions
- scientific article; zbMATH DE number 3879003 (Why is no real title available?)
- A Monte Carlo Factoring Algorithm With Linear Storage
- Running Time Predictions for Factoring Algorithms
- Efficient CM-constructions of elliptic curves over finite fields
- scientific article; zbMATH DE number 3959522 (Why is no real title available?)
- A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
- scientific article; zbMATH DE number 4095549 (Why is no real title available?)
- Algorithms in Algebraic Number Theory
- Computations of class numbers of real quadratic fields
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective
- Integer factoring using small algebraic dependencies
- scientific article; zbMATH DE number 849975 (Why is no real title available?)
- Faster Computation of the First Factor of the Class Number of ℚ(ζ p )
- An exponent one-fifth algorithm for deterministic integer factorisation
- The number of solutions of the Erdős-Straus equation and sums of k unit fractions
- Computation of lattice isomorphisms and the integral matrix similarity problem
- \(\ell\)-adic images of Galois for elliptic curves over \(\mathbb{Q}\)(and an appendix with John Voight)
- Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
- Anatomy of torsion in the CM case
- Computing endomorphism rings of abelian varieties of dimension two
- Optimal factorizations of rational numbers using factorization trees
- Torsion points on CM elliptic curves over real number fields
- Modular polynomials via isogeny volcanoes
- Finding the group structure of elliptic curves over finite fields
- Analysis of some elementary algorithms for prime factorization
- Efficient reductions and algorithms for subset product
- Orders of Gauss periods in finite fields
- Online algorithms on antipowers and antiperiods
- CryptAttackTester: high-assurance attack analysis
- Fast square-free decomposition of integers using class groups
- Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
- Computing supersingular endomorphism rings using inseparable endomorphisms
- There are infinitely many Perrin pseudoprimes
This page was built for publication: A Rigorous Time Bound for Factoring Integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4019632)
