Finding a small root of a univariate modular equation

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

Volumn 1070, Issue , 1996, Pages 155-165

  Coppersmith, Don ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS;

CIPHERTEXTS; PLAINTEXT; POLYNOMIAL EQUATION; RSA ENCRYPTION; SINGLE VARIABLE; UNIVARIATE;

CRYPTOGRAPHY;

EID: 84947924912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_14     Document Type: Conference Paper

References (4)

1. D. Coppersmith, M. Franklin, J. Patarin and M. Reiter, "Low Exponent RSA with Related Messages," Proceedings of Eurocrypt 96.
2. M. Franklin and M. Reiter, "A Linear Protocol Failure for RSA with Exponent Three," presented at the rump session, Crypto 95, but not in the proceedings.
3. A. K. Lenstra, H. W. Lenstra and L. Lovasz, "Factoring Polynomials with Integer Coefficients," Matematische Annalen 261 (1982), 513-534.
4. B. Vallée, M. Girault and P. Toffin, "How to Guess 4-th Roots Modulo n by Reducing Lattice Bases," Proceedings of AAECC-6, Springer LNCS 357 (1988) 427-442.