Sparse Polynomial Interpolation Based on Diversification

by   Qiao-Long Huang, et al.

We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero, we develop a new Monte Carlo algorithm over the finite field by doing additional probes. To interpolate a polynomial f∈ F_q[x_1,…,x_n] with a partial degree bound D and a term bound T, our new algorithm costs O^(nTlog ^2q+nT√(D)log q) bit operations and uses 2(n+1)T probes to the black box. If q≥ O(nT^2D), it has constant success rate to return the correct polynomial. Compared with previous algorithms over general finite field, our algorithm has better complexity in the parameters n,T,D and is the first one to achieve the complexity of fractional power about D, while keeping linear in n,T. A key technique is a randomization which makes all coefficients of the unknown polynomial distinguishable, producing a diverse polynomial. This approach, called diversification, was proposed by Giesbrecht and Roche in 2011. Our algorithm interpolates each variable independently using O(T) probes, and then uses the diversification to correlate terms in different images. At last, we get the exponents by solving the discrete logarithms and obtain coefficients by solving a linear system. We have implemented our algorithm in Maple. Experimental results shows that our algorithm can applied to sparse polynomials with large degree. We also analyze the success rate of the algorithm.


page 1

page 2

page 3

page 4


Sparse Interpolation of Black-box Multivariate Polynomials using Kronecker Type Substitutions

In this paper, we give two new deterministic interpolation algorithms fo...

Faster Algorithms via Waring Decompositions

We show that decompositions of certain polynomials as sums of powers of ...

Revisit Randomized Kronecker Substitution based Sparse Polynomial Interpolation

In this paper, a new Monte Carlo interpolation algorithm for sparse mult...

Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes

In this paper we present a new algorithm for Polynomial Linear System So...

Local Inversion of maps: Black box Cryptanalysis

This paper is a short summery of results announced in a previous paper o...

Modified discrete Laguerre polynomials for efficient computation of exponentially bounded Matsubara sums

We develop a new type of orthogonal polynomial, the modified discrete La...

Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding

We present sparse interpolation algorithms for recovering a polynomial w...

Please sign up or login with your details

Forgot password? Click here to reset