Divisors in residue classes, constructively

DOI10.1090/S0025-5718-07-02007-8zbMath1131.11080MaRDI QIDQ5429512

Don Coppersmith, N. A. Howgrave-Graham, Santosh V. Nagaraj

Publication date: 30 November 2007

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

zbMATH Keywords

divisorsresidue classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05) Primality (11Y11)

Related Items (8)

Deterministic factoring with oracles ⋮ Egyptian fractions of bounded length ⋮ An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient ⋮ List Decoding for Binary Goppa Codes ⋮ On the Diophantine equation \(ax^3 + by + c = xyz\) ⋮ A deterministic version of Pollard’s $p-1$ algorithm ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ EQUIDISTRIBUTION OF DIVISORS IN RESIDUE CLASSES AND REPRESENTATIONS BY BINARY QUADRATIC FORMS

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Divisors in Residue Classes
• New Primality Criteria and Factorizations of 2 m ± 1

This page was built for publication: Divisors in residue classes, constructively