Small solutions to polynomial equations, and low exponent RSA vulnerabilities

Journal of Cryptology

Volumn 10, Issue 4, 1997, Pages 233-260

  Coppersmith, Don ^a  

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

Author keywords

Factoring; Polynomial; RSA

Indexed keywords

EID: 0001494997     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900030     Document Type: Article

References (15)

1. M. Bellare and P. Rogaway, Optimal asymmetric encryption, Advances in Cryplology-EUKOCRYPT '94 (A. De Santis, ed.), pp. 92-111, LNCS, 950, Springer-Verlag, Berlin, 1995.
2. D. Coppersmith, Finding a small root of a univariate modular equation. Advances in CryplologyEUROCRYPT '96 (U. Maurer, ed.), pp. 155-165, LNCS, 1070, Springer-Verlag, Berlin, 1996.
3. D. Coppersmith, Finding a small root of a bivariate integer equation; factoring with high bits known, Advances in Cryplology-EUROCRYPT '96 (U. Maurer, ed.), pp. 178-189, LNCS, 1070, Springer-Verlag, Berlin, 1996.
4. D. Coppersmith, Factoring with a hint, IBM Research Report RC 19905, January 16, 1995.
5. D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter, Low-exponent RSA with related messages, Advances in Cryplology-EUROCRYPT '96 (U. Maurer, ed.), pp. 1-9, LNCS, 1070, Springer-Verlag, Berlin, 1996.
6. M. Franklin and M. Reiter, A linear protocol failure for RSA with exponent three, Rump Session, Crypto '95 (not in proceedings).
7. J. Hastad. Solving simultaneous modular equations of low degree, SIAM J. Comput. 17(1988), 336-341.
8. M. Joye and J.-J. Quisquater, Protocol failures for RSA-like functions using Lucas sequences and elliptic curves, Presented at the Cambridge Workshop on Cryptographic Protocols, Cambridge, April 14-18, 1996.
9. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovdsz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515-534.
10. K. Manders and L. Adleman, NP-complete decision problems for binary quadratics, J. Comput. System Sei. 16(1978), 168-184.
11. J. Patarin, Personal communication, 1995.
12. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM 2\(1) (1978), 120-126.
13. R. L. Rivest and A. Shamir, Efficient factoring based on partial information, Advances in CryplologyEUROCRYPT '85, pp. 31-34, LNCS, 219, Springer-Verlag, Berlin, 1986.
14. D. E. Knuth, The Art of Computer Programming, vol. 2, 2nd edn., Section 4.6.1, Addison-Wesley, Reading, Massachusetts, 1981.
15. S. A. Vanstone and R. J. Zuccherato, Short RSA keys and their generation, J. Cryptology 8(2) (1995), 101-114.