Abstract
We present a method to solve integer polynomial equations in two variables, provided that the solution is suitably bounded. As an application, we show how to find the factors of N = PQ if we are given the high order ((1/4) log2 N) bits of P. This compares with Rivest and Shamir’s requirement of ((1/3) log2 N) bits.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Coppersmith, “Finding a Small Root of a Univariate Modular Equation,” Proceedings of Eurocrypt 96.
A. K. Lenstra, H. W. Lenstra and L. Lovasz, “Factoring Polynomials with Integer Coefficients,” Matematische Annalen 261 (1982), 513–534.
K. Manders and L. Adleman, “NP-complete decision problems for binary quadratics,” J. Comput. System Sci. 16, 168–184.
U. M. Maurer, “Factoring with an Oracle,” Advances in Cryptology — EUROCRYPT’92, Springer LNCS 658 (1993) 429–436.
R. L. Rivest and A. Shamir, “Efficient factoring based on partial information,” Advances in Cryptology — EUROCRYPT’85, Springer LNCS 219 (1986) 31–34.
B. Vallée, M. Girault and P. Toffin, “How to Guess ℓ-th Roots Modulo n by Reducing Lattice Bases,” Proceedings of AAECC 6, Springer LNCS 357 (1988) 427–442.
S. A. Vanstone and R. J. Zuccherato, “Short RSA Keys and Their Generation,” Journal of Cryptology 8 number 2 (Spring 1995) 101–114.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coppersmith, D. (1996). Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. In: Maurer, U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68339-9_16
Download citation
DOI: https://doi.org/10.1007/3-540-68339-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61186-8
Online ISBN: 978-3-540-68339-1
eBook Packages: Springer Book Archive