Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
复制标题
DOI：
10.1007/3-540-68339-9_16
复制
发表时间：
1996-05
期刊：
影响因子：
--
通讯作者：
D. Coppersmith
中科院分区：
文献类型：
--
作者：
D. Coppersmith
给出了一种求解二元整数多项式方程的方法，只要方程的解是有界的。作为一个应用，我们给出了在给定P的高阶（（1/4）log 2N）比特的情况下，如何求N = PQ的因子.这与Rivest和Shamir的（（1/3）log 2N）位的要求相比。
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 ofN=PQif we are given the high order ((1/4) log2N) bits ofP. This compares with Rivest and Shamir’s requirement of ((1/3) log2N) bits.