• DOI:10.1007/s001459900030
Corpus ID: 15726802

Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities

@article{Coppersmith1997SmallST,
  title={Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities},
  author={D. Coppersmith},
  journal={Journal of Cryptology},
  year={1997},
  volume={10},
  pages={233-260}
}

D. Coppersmith

Published 1997

Mathematics, Computer Science

Journal of Cryptology

View on Springer

di.ens.fr

Save to Library

Create Alert

Cite

Launch Research Feed

Abstract. We show how to find sufficiently small integer solutions to a polynomial in a single variable modulo N, and to a polynomial in two variables over the integers. The methods sometimes extend to more variables. As applications: RSA encryption with exponent 3 is vulnerable if the opponent knows two-thirds of the message, or if two messages agree over eight-ninths of their length; and we can find the factors of N=PQ if we are given the high order
$\frac{1}{4} \log_2 N$ bits of P.