Computing prime divisors in an interval

DOI10.1090/S0025-5718-2014-02840-8zbMath1352.11104MaRDI QIDQ5497026

Jung Hee Cheon, Minkyu Kim

Publication date: 30 January 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

integer factorizationprime divisors in an interval

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• PRIMES is in P
• Fast multiplication of large numbers
• Finding a Small Root of a Univariate Modular Equation
• Explicit Bounds for Primality Testing and Related Problems
• A p + 1 Method of Factoring
• A monte carlo method for factorization
• A method for obtaining digital signatures and public-key cryptosystems
• Monte Carlo Methods for Index Computation (mod p)