Divisors in residue classes, constructively

Mathematics of Computation

Volumn 77, Issue 261, 2008, Pages 531-545

  Coppersmith, Don ^a   Howgrave Graham, Nick ^b   Nagaraj, S V ^c  

^a INSTITUTE FOR DEFENSE ANALYSES   (United States)

^b NTRU Cryptosystems   (United States)

^c NONE   (India)

Author keywords

Divisors; Residue classes

Indexed keywords

EID: 38849209132     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-07-02007-8     Document Type: Article

References (12)

1. D. J. Bernstein, Reducing lattice bases to find small-height values of univariate polynomials, in "Surveys in algorithmic number theory", Mathematical Sciences Research Institute Publications, Vol. 44, Cambridge University Press (to appear).
2. D. Boneh, G. Durfee, Y. Frankel, An attack on RSA given a fraction of the private key bits, Proc. of Asiacrypt 98, Springer Lecture Notes in Comput. Sci., vol. 1514, pp. 25-34. MR1726151
3. m ±1, Math. Comp., vol. 29, 1975, pp. 620-647. MR0384673 (52:5546)
4. D. Coppersmith, Finding a small root of a bivariate integer equation; factoring with high bits known, Proc. of Eurocrypt 96, Springer Lecture Notes in Comput. Sci., vol. 1070, pp. 178-189. MR1421585 (97h:94009)
5. H. Cohen, Diviseurs appartenant à une même classe résiduelle, Seminar on number theory, 1982-83, University of Bordeaux I, Talence, Exp. No. 16, 1982-1983, 12 pp. MR750317 (85i:11002)
6. N, A. Howgrave-Graham, Finding small roots of univariate modular equations revisited, Proc. of Cryptography and Coding, 1997, Springer Lecture Notes in Comput. Sci., vol. 1355, pp. 131-142. MR1660500 (99j:94049)
7. N. A. Howgrave-Graham, Computational mathematics inspired by RSA, Ph.D. thesis, University of Bath, UK. 1999.
8. H. W. Lenstra, Jr., Divisors in Residue Classes, Math. Comp., vol. 42, no. 165, January 1984, pp. 331-340. MR726007 (85b:11118)
9. A. K. Lenstra, H. W. Lenstra and L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann., 261 (1982), 515-534. MR0682664 (84a:12002)
10. S, Konyagin, C. Pomerance, On primes recognizable in deterministic polynomial time, in "The Mathematics of Paul Erdös", Eds.: R.L. Graham, J. Nesetril, 1996. ISBN 3-540-61032-4. MR1425185 (98a:11184)
11. R. Crandall, C. Pomerance, Prime numbers: a computational perspective, Springer-Verlag, New York, NY, 2001. ISBN 0-387-94777-9. MR1821158 (2002a:11007)
12. V. Shoup, NTL: A Library for doing Number Theory (version 4.0a), www.shoup.net