@article{10902/8037,
year = {2014},
url = {http://hdl.handle.net/10902/8037},
abstract = {Let $ p$ be a prime and $ \mathbb{F}_p$ the finite field with $ p$ elements. We show how, when given an irreducible bivariate polynomial $ F \in \mathbb{F}_p[X,Y]$ and an approximation to a zero, one can recover the root efficiently, if the approximation is good enough. The strategy can be generalized to polynomials in the variables $ X_1,\ldots ,X_m$ over the field $ \mathbb{F}_p$. These results have been motivated by the predictability problem for nonlinear pseudorandom number generators and other potential applications to cryptography.},
publisher = {American Mathematical Society},
publisher = {Mathematics of computation 83 (2014), 2953-2965},
title = {Recovering zeros of polynomials modulo a prime},
author = {Gómez Pérez, Domingo and Gutiérrez Gutiérrez, Jaime},
}