Deterministic factoring with oracles
From MaRDI portal
Publication:6115442
DOI10.1007/s00200-021-00521-8arXiv1802.08444OpenAlexW3201109067MaRDI QIDQ6115442
No author found.
Publication date: 12 July 2023
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.08444
LLL algorithmCoppersmith's methodlattice basis reductioncontinuous fractionsdeterministic integer factorization
Number-theoretic algorithms; complexity (11Y16) Arithmetic functions; related numbers; inversion formulas (11A25) Factorization; primality (11A51) Factorization (11Y05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Reductions among number theoretic problems
- Some remarks on computing the square parts of integers
- Factoring polynomials with rational coefficients
- Miller's primality test
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- PRIMES is in P
- Further results on implicit factoring in polynomial time
- Factoring $$N=p^rq^s$$ for Large r and s
- Faster deterministic integer factorization
- Modern Computer Algebra
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Factor Refinement
- A babystep-giantstep method for faster deterministic integer factorization
- Divisors in Residue Classes
- Detecting perfect powers by factoring into coprimes
- Implicit Factoring with Shared Most Significant and Middle Bits
- An LLL Algorithm with Quadratic Complexity
- A deterministic version of Pollard’s $p-1$ algorithm
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
- Efficient Factoring Based on Partial Information
- Sums of Divisors, Perfect Numbers and Factoring
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient
- Factoring into coprimes in essentially linear time
- Factoring Large Integers
- An exponent one-fifth algorithm for deterministic integer factorisation
- A time-space tradeoff for Lehman’s deterministic integer factorization method
- A log-log speedup for exponent one-fifth deterministic integer factorisation
- Approximate Integer Common Divisor Problem Relates to Implicit Factorization
- Advances in Cryptology - EUROCRYPT 2004
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- An LLL-reduction algorithm with quasi-linear time complexity
- Divisors in residue classes, constructively
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- A New Proof of a Theorem of Van Der Corput
- On the Sum ∑k=1xd(f(k))
This page was built for publication: Deterministic factoring with oracles
