pith. sign in

arxiv: 1401.1331 · v1 · pith:EZQTI7IBnew · submitted 2014-01-07 · 🧮 math.NT · cs.CR· cs.DS

Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values

classification 🧮 math.NT cs.CRcs.DS
keywords interpolationintervalnoisypolynomialshortvaluesapproximateapproximation
0
0 comments X
read the original 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) \in 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.