Welcome to the resource topic for 2007/088
Title:
An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers
Authors: Domingo Gomez, Jaime Gutierrez, Alvar Ibeas
Abstract:In this paper we present a new algorithm for finding small roots of a system of multivariate polynomials over the integers based on lattice reduction techniques. Our simpler heuristic method is inspired in algorithms for predicting pseudorandom numbers, and it can be considered as another variant of Coppersmith’s method for finding small solutions of integer bivariate polynomials. We also apply the method to the well known problem of factoring an integer when we know the high-order bits of one of the factors.
ePrint: https://eprint.iacr.org/2007/088
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .