Finding small roots of univariate modular equations revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1355, Issue , 1997, Pages 131-142

  Howgrave Graham, Nicholas ^a  

^a UNIVERSITY OF BATH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRYPTOGRAPHIC SCHEMES; DUAL LATTICES; LLL ALGORITHM; UNIVARIATE;

CRYPTOGRAPHY;

EID: 84949226531     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024458     Document Type: Conference Paper

References (4)

1. Cassels, J. W. S. 1971. An introduction to the geometry of numbers. Springer.
2. Cohen, H. 1991. A Course in Computational Algebraic Number Theory. Springer-Verlag.
3. Coppersmith, D. 1996. Finding a small root of a univariate modular equation. In: Proceedings of Eurocrypt 96.
4. Lenstra, A. K., Lenstra, H. W., & Lovasz, L. 1982. Factoring polynomials with integer coefficients. Mathematische Annalen, 261, 513-534.