ubuntor / coppersmith-algorithm

Implements Coron's simplification of Coppersmith's algorithm
GNU General Public License v3.0
41 stars 7 forks source link

Computing roots "modulo an integer" is not supported #1

Open maxale opened 4 years ago

maxale commented 4 years ago

It is "finding small integer roots of a bivariate polynomial modulo an integer", however there is no way to specify this integer. Only polynomials over Z (not Z/mZ) are supported.

maxale commented 3 years ago

I've fixed this issue in my recent pull request.