Reconstructing noisy polynomial evaluation in residue rings
From MaRDI portal
Publication:3414545
DOI10.1016/j.jalgor.2004.07.002zbMath1178.68220MaRDI QIDQ3414545
Domingo Gómez-Pérez, Jaime Gutierrez, Simon R. Blackburn, Igor E. Shparlinski
Publication date: 9 January 2007
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.07.002
polynomial congruences; lattice basis reduction; noisy interpolation; predicting pseudorandom generators
Related Items
Predicting nonlinear pseudorandom number generators, Reconstructing points of superelliptic curves over a prime finite field, Fixed points of the subset sum pseudorandom number generators, Inferring sequences produced by the quadratic generator, On the modular inversion hidden number problem, Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits, Recovering zeros of polynomials modulo a prime