Binary Independence Model

The Coppersmith method, proposed by Don Coppersmith, is a method to find small integer roots of polynomial equations. These polynomials can be univariate or bivariate. In cryptography the algorithm is mainly used in attacks on RSA when parts of the secret key are known.

The method uses the LLL algorithm to find a polynomial that has the roots of the target polynomial as roots and has small coefficients.

Coppersmith’s method is based on lattice reduction. A lattice L is a subgroup of ${\mathbf{R}}^n$. Also there exists a k such that $L=\mathbf{Z}{b}_1\oplus \dots \oplus \mathbf{Z}{b}_k$, where $B=(b_1,b_2,\dots ,b_k)$ is a basis of L. The LLL algorithm computes a basis $(b_1^{*},b_2^{*},\dots ,b_k^{*})$ of short vectors. If k=n, the determinant of the lattice is given by det(L)=det(B); in general $\mathrm{d}\mathrm{e}\mathrm{t}(L)\le \prod \left|\right|b_i^{*}\left|\right|$.

For any LLL reduced basis $(b_1^{*},b_2^{*},\dots ,b_k^{*})$ it holds that $\left|\right|b_k^{*}\left|\right|\ge (\mathrm{d}\mathrm{e}\mathrm{t}(L){)}^{1/k}\cdot 2^{(1-k)/4}$, see.

Let $F(x)=x^n+a_{n-1}{x}^{n-1}+\dots +a_{1}x+a_0$ and assume that $F(x_0)\equiv 0modM$ for some integer $\left|x_0\right|<M^{1/n}$. Coppersmith’s algorithm can be used to find this integer solution $x_0$.

Finding roots over Q is easy using e.g. Newton's method but these algorithms do not work modulo a composite number M. The idea behind Coppersmith’s method is to find a different polynomial $F_2$ related to F that has the same $x_0$ as a solution and has only small coefficients. If the coefficients and $x_0$ are so small that $F_2(x_0)<M$ over the integers, then $x_0$ is a root of F over Q and can easily be found.

How to find small roots using Coppersmith's method

Coppersmith’s approach is a reduction of solving modular polynomial equations to solving polynomials over the integers. Coppersmith's algorithm uses LLL to construct the polynomial $F_2$ with small coefficients.

Given F, the algorithm constructs polynomials $p_1(x),p_2(x),\dots ,p_n(x)$ that have the same $x_0$ as root modulo $M^a$, where a is some integer chosen dependent on the degree of F and the size of $x_0$. Any linear combination of these polynomials has $x_0$ as root modulo $M^a$.

The next step is to use the LLL algorithm to construct a linear combination $F_2(x)=\sum c_i{p}_i(x)$ of the $p_i$ so that the inequality $|F_2(x)|<M^a$ holds. Now standard factorization methods can calculate the roots of $F_2(x)$ over the integers.

See also

Coppersmith's Attack