Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values
Abstract
Motivated by a recently introduced HIMMO key distribution scheme, we consider a modification of the noisy polynomial interpolation problem of recovering an unknown polynomial f(X) ∈ Z[X] from approximate values of the residues of f(t) modulo a prime p at polynomially many points t taken from a short interval.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.