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} }
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.
Topics from this paper
Paper Mentions
Blog Post
688 Citations
Application of ECM to a class of RSA keys
- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 2006
- 2
- PDF
Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Computer Science, Mathematics
- Groups Complex. Cryptol.
- 2016
- 1
Factoring RSA moduli with primes sharing bits in the middle
- Mathematics, Computer Science
- Applicable Algebra in Engineering, Communication and Computing
- 2017
- 2
- Highly Influenced
A new RSA vulnerability using continued fractions
- Computer Science
- 2008 IEEE/ACS International Conference on Computer Systems and Applications
- 2008
- 8
Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
- Mathematics, Computer Science
- ACISP
- 2013
- 11
- Highly Influenced
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- Computer Science, Mathematics
- CRYPTO
- 2007
- 42
- PDF
New Results on Solving Linear Equations Modulo Unknown Divisors and its Applications
- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2014
- 6
- PDF
Factoring multi power RSA moduli with a class of secret exponents
- Mathematics
- 2015
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 15 REFERENCES
Finding a Small Root of a Univariate Modular Equation
- Mathematics, Computer Science
- EUROCRYPT
- 1996
- 309
- PDF
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Mathematics, Computer Science
- EUROCRYPT
- 1996
- 265
- PDF
Solving Simultaneous Modular Equations of Low Degree
- Mathematics, Computer Science
- SIAM J. Comput.
- 1988
- 187
- PDF
Protocol Failures for RSA-Like Functions Using Lucas Sequences and Elliptic Curves
- Computer Science
- Security Protocols Workshop
- 1996
- 10
- PDF
NP-Complete Decision Problems for Binary Quadratics
- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 1978
- 101
- PDF
A method for obtaining digital signatures and public-key cryptosystems
- Computer Science
- CACM
- 1978
- 7,150
- PDF