Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later proposed in [9], but it was asymptotically less efficient than Coppersmith's algorithm. In this paper, we describe an analogous simplification but with the same asymptotic complexity as Coppersmith. We illustrate our new algorithm with the problem of factoring RSA moduli with high-order bits known; in practical experiments our method is several orders of magnitude faster than [9]. © International Association for Cryptologic Research 2007.
CITATION STYLE
Coron, J. S. (2007). Finding small roots of bivariate integer polynomial equations: A direct approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4622 LNCS, pp. 379–394). Springer Verlag. https://doi.org/10.1007/978-3-540-74143-5_21
Mendeley helps you to discover research relevant for your work.