Get the latest tech news
Univariate Coppersmith Algorithm
Mathematical endeavors by a bookworm
We aim to find a root of the polynomial modulo some integer NNN. By setting ϵ=1logN\epsilon = \frac{1}{log N}ϵ=logN1 and exhaustively searching the few unknown high bits of x0x_0x0, we can extend the range to x0<N1kx_0 < N^{\frac{1}{k}}x0<Nk1. There is a 111 in each column, so by performing the elementary operations on the rows, we can transform this submatrix into the matrix M′M'M′:
Or read this on Hacker News