Dual Coppersmith:Finding Small Roots Without Multivariate Polynomial SystemsResearch Paper
A bounded modular root is an integer solution of polynomial congruences whose coordinates lie in specified short intervals. Such problems arise in public-key cryptanalysis when an attacker knows algebraic relations involving a small unknown quantity. The usual multivariate Coppersmith workflow first uses lattice reduction to produce auxiliary integer…