Skip to main content
Springer Nature Link
Log in

Noisy interpolation of sparse polynomials in finite fields

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We consider a polynomial analogue of the hidden number problem introduced by Boneh and Venkatesan, namely the sparse polynomial noisy interpolation problem of recovering an unknown polynomial f(X) ∈ [X] with at most w non-zero terms from approximate values of f(t) at polynomially many points t ∈ selected uniformly at random. We extend the polynomial time algorithm of the first author for polynomials f(X) of sufficiently small degree to polynomials of almost arbitrary degree. Our result is based on a combination of some number theory tools such as bounds of exponential sums and the number of solutions of congruences with the lattice reduction technique. The new idea is motivated by Waring's problem and uses a recent bound on exponential sums of Cochrane, Pinner, and Rosenhouse.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Ar, S., Lipton, R., Rubinfeld, R., Sudan, M.: Reconstructing algebraic functions from erroneous data. SIAM J. Comput. 28, 487–510 (1999)

    Article  MathSciNet  Google Scholar 

  2. Arora, S., Sudan, M.: Improved low-degree testing and its applications. In: Proc. 29nd ACM Symp. on Theory of Comp. 1997, New York: ACM 1999, pp. 485–495

  3. Bleichenbacher, D., Nguyen, P.Q.: Noisy polynomial interpolation and noisy Chinese remaindering. Lect. Notes in Comp. Sci. 1807, 53–69 (2000)

    MATH  MathSciNet  Google Scholar 

  4. Boneh, D., Venkatesan, R.: Hardness of computing the most significant bits of secret keys in Diffie–Hellman and related schemes. Lect. Notes in Comp. Sci. 1109, 129–142 (1996)

    Article  Google Scholar 

  5. Boneh, D., Venkatesan, R.: Rounding in lattices and its cryptographic applications. In: Proc. 8th Annual ACM-SIAM Symp. on Discr. Algorithms, pp. 675–681. New York: ACM 1997

  6. Chistov, A.L., Karpinski, M.: Fast interpolation algorithms for sparse polynomials with respect to the size of coefficients. Research Report 85109–CS, Bonn Univ., 1994

  7. Clausen, M., Dress, A., Grabmeier, J., Karpinski, M.: On zero testing and interpolation of k-sparse multivariate polynomials over finite fields. Theor. Comp. Sci. 84, 151–164 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cochrane, T., Pinner, C., Rosenhouse, J.: Bounds on exponential sums and the polynomial Waring problem mod p. J. London Math. Soc. 67, 319–336 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Codenotti, B., Shparlinski, I.E., Winterhof, A.: Non-approximability of the permanent of structured matrices over finite fields. Comp. Compl. 11, 158–170 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. von zur Gathen, J., Shparlinski, I.E.: Polynomial interpolation from multiples, In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, SIAM 2004 pp. 1125–1130

  11. Goldreich, O., Rubinfeld, R., Sudan, M.: Learning polynomials with queries: the highly noisy case. Electronic Colloq. on Comp. Compl., Univ. of Trier TR1998-060, 1–34 (1998)

    Google Scholar 

  12. Grigoriev, D., Karpinski, M., Singer, M.: Computational complexity of sparse rational interpolation. SIAM J. Comput. 23, 1–11 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Guruswami, V., Sudan, M.: Improved decoding of Reed–Solomon and algebraic geometric codes. IEEE Trans. Inform. Theory 45, 1757–1767 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kiwi, M., Magniez, F., Santha, M.: Exact and approximate testing/correcting of algebraic functions: A survey'. Electronic Colloq. on Comp. Compl., Univ. of Trier TR2001-014, 1–49 (2001)

    Google Scholar 

  15. Klivans, A.R., Spielman, D.A.: Randomness efficient identity testing of multivariate polynomials. In: Proc. 33rd ACM Symp. on Theory of Comp., ACM 2001 pp. 216–223

  16. Lewin, D., Vadhan, S.: Checking polynomial identities over any field: Towards a derandomization? In: Proc. 30th ACM Symp. on Theory of Comp., ACM 1998, pp. 438–447

  17. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge: University Press 1997

  18. Lipton, R., Vishnoi, N.: Deterministic identity testing for multivariate polynomials. In: Proc. 14th ACM-SIAM Symp. on Discr. Algorithms, SIAM 2003 pp. 756–760

  19. Micciancio, D.: On the hardness of the shortest vector problem, PhD Thesis, MIT 1998

  20. Nguyen, P.Q., Stern, J.: Lattice reduction in cryptology: An update. Lect. Notes in Comp. Sci. 1838, 85–112 (2000)

    MATH  Google Scholar 

  21. Shokrollahi, M.A., Wasserman, H.: List decoding of algebraic-geometric codes. IEEE Trans. Inform. Theory 45, 432–437 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  22. Shparlinski, I.E.: Sparse polynomial approximation in finite fields. In: Proc. 33rd ACM Symp. on Theory of Comput., pp. 209–215. Crete: 2001

  23. Shparlinski, I.E., Winterhof, A.: A hidden number problem in small subgroups. Math. Comp., to appear

  24. Shparlinski, I.E., Winterhof, A.: A nonuniform algorithm for the hidden number problem in subgroups. In: Proc. Intern. Workshop on Public Key Cryptography, Singapore, 2004, Lect. Notes in Comp. Sci. 2947, 416–424 (2004)

  25. Vinogradov, I.M.: Elements of Number Theory. New York: Dover Publications, Inc., 1954

  26. Wasserman, H.: Reconstructing randomly sampled multivariate polynomials from highly noisy data. In: Proc. 9th ACM-SIAM Symp. on Discr. Algorithms, SIAM 1998 pp. 59–67

  27. Werther, K.: The complexity of sparse polynomial interpolation over finite fields. Appl. Algebra in Engin., Commun. and Comp. 5, 91–103 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  28. Zippel, R.: Effective polynomial computation. Dordrecht: Kluwer Acad. Publ. 1993

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Macquarie University, Sydney, NSW, 2109, Australia

    Igor Shparlinski

  2. Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstrasse 69, 4040, Linz, Austria

    Arne Winterhof

Authors
  1. Igor Shparlinski
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Arne Winterhof
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Arne Winterhof.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shparlinski, I., Winterhof, A. Noisy interpolation of sparse polynomials in finite fields. AAECC 16, 307–317 (2005). https://doi.org/10.1007/s00200-005-0180-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-005-0180-1

Keywords