Query-Efficient Algorithms for Polynomial Interpolation over Composites

DOI10.1137/060661259zbMath1187.68261OpenAlexW1968426698MaRDI QIDQ3631901

Parikshit Gopalan

Publication date: 22 June 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060661259

zbMATH Keywords

interpolationcompositespolynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Interpolation in approximation theory (41A05)

Related Items (2)

Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ Polynomial interpolation over the residue rings \(\mathbb Z_n\)

This page was built for publication: Query-Efficient Algorithms for Polynomial Interpolation over Composites