Reconstructing noisy polynomial evaluation in residue rings

DOI10.1016/J.JALGOR.2004.07.002zbMATH Open1178.68220OpenAlexW2126897083MaRDI QIDQ3414545FDOQ3414545

Authors: Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, 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

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

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3414545)