Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known

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 + \epsilon) (log N)$ bits of $P$. This compares with Rivest and Shamir's factor 1/3.

By: Don Coppersmith

Published in: RC20280 in 1995


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

Questions about this service can be mailed to .