Welcome to the resource topic for 2004/339
Title:
Divisors in Residue Classes, Constructively
Authors: Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj
Abstract:Let r,s,n be integers satisfying 0 \leq r < s < n,
s \geq n^{\alpha}, \alpha > 1/4, and \gcd(r,s)=1. Lenstra showed that the number of integer divisors of n equivalent to
r \pmod s is upper bounded by O((\alpha-1/4)^{-2}). We re-examine this problem; showing how to explicitly construct all such divisors and incidentally improve this bound to O((\alpha-1/4)^{-3/2}).
ePrint: https://eprint.iacr.org/2004/339
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .