Query-Efficient Algorithms for Polynomial Interpolation over Composites

DOI10.1137/060661259MaRDI QIDQ3631901zbMATH OpenOpenAlexFDO

Authors 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

compositesinterpolationpolynomials

Mathematics Subject Classification ID

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

Recommendations

• Polynomial interpolation and identity testing from high powers over finite fields
• scientific article; zbMATH DE number 6820205
• Quantum interpolation of polynomials
• Interpolation of polynomials given by straight-line programs
• Noisy polynomial interpolation modulo prime powers

Cited in

(4)

• Iterative polynomial interpolation and data compression
• Combinatorial algorithms for the interpolation of polynomials in dimension 2
• Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
• Polynomial interpolation over the residue rings Z_n

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

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