Reconstructing noisy polynomial evaluation in residue rings

DOI10.1016/j.jalgor.2004.07.002zbMath1178.68220OpenAlexW2126897083MaRDI 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

zbMATH Keywords

polynomial congruenceslattice basis reductionnoisy interpolationpredicting pseudorandom generators

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data encryption (aspects in computer science) (68P25)

Related Items (7)

Recovering zeros of polynomials modulo a prime ⋮ Reconstructing points of superelliptic curves over a prime finite field ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ On the modular inversion hidden number problem ⋮ Inferring sequences produced by the quadratic generator ⋮ Predicting nonlinear pseudorandom number generators ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits

This page was built for publication: Reconstructing noisy polynomial evaluation in residue rings