Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values
Number Theory
2014-01-08 v1 Cryptography and Security
Data Structures and Algorithms
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 from approximate values of the residues of modulo a prime at polynomially many points taken from a short interval.
Keywords
Cite
@article{arxiv.1401.1331,
title = {Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values},
author = {Oscar Garcia-Morchon and Ronald Rietman and Igor E. Shparlinski and Ludo Tolhuizen},
journal= {arXiv preprint arXiv:1401.1331},
year = {2014}
}