Abstract
In this paper, we present a polynomial lattice method to solve the approximate polynomial common divisor problem. This problem is the polynomial version of the well known approximate integer common divisor problem introduced by Howgrave-Graham (Calc 2001). Our idea can be applied directly to solve the noisy multipolynomial reconstruction problem in the field of error-correcting codes. Compared to the method proposed by Devet, Goldberg and Heninger in USENIX 2012, our approach is faster.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bleichenbacher, D., Nguyen, P.Q.: Noisy polynomial interpolation and noisy Chinese remaindering. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 53–69. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-45539-6_4
Cheon, J.H., et al.: Batch fully homomorphic encryption over the integers. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 315–335. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38348-9_20
Cheon, J.H., Stehlé, D.: Fully homomorphic encryption over the integers revisited. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology - EUROCRYPT 2015. Lecture Notes in Computer Science, vol. 9056, pp. 513–536. Springer, Berlin Heidelberg (2015)
Cheon, J.H., Hong, H., Lee, M.S., Ryu, H.: The polynomial approximate common divisor problem and its application to the fully homomorphic encryption. Inf. Sci. 326, 41–58 (2016)
Cohn, H., Heninger, N.: Approximate common divisors via lattices. Open Book Ser. 1(1), 271–293 (2013)
Cohn, H., Heninger, N.: Ideal forms of Coppersmith’s theorem and Guruswami-Sudan list decoding. Adv. Math. Comm. 9(3), 311–339 (2015)
Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233–260 (1997)
Corless, R.M., Gianni, P.M., Trager, B.M., Watt, S.M.: The singular value decomposition for polynomial systems. In: Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, pp. 195–207. ACM (1995)
Corless, R.M., Watt, S.M., Zhi, L.: QR factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Sig. Process. 52(12), 3394–3402 (2004)
Coron, J.-S., Lepoint, T., Tibouchi, M.: Scale-invariant fully homomorphic encryption over the integers. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 311–328. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54631-0_18
Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487–504. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22792-9_28
Coron, J.-S., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 446–464. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_27
Devet, C., Goldberg, I., Heninger, N.: Optimally robust private information retrieval. In: Proceedings of the 21st USENIX Conference on Security Symposium, Security 2012, Berkeley, CA, USA, p. 13. USENIX Association (2012)
Eliaš, J.: Approximate polynomial greatest common divisor. Ph.D. thesis, Master thesis, Charles University in Prague (2012)
Emiris, I.Z., Galligo, A., Lombardi, H.: Numerical univariate polynomial GCD. Lect. Appl. Math. Am. Math. Soc. 32, 323–344 (1996)
Giesbrecht, M., Haraldson, J., Kaltofen, E.: Computing approximate greatest common right divisors of differential polynomials (2017). CoRR, abs/1701.01994
Giorgi, P., Jeannerod, C.-P., Villard, G.: On the complexity of polynomial matrix computations. In: Proceedings of Symbolic and Algebraic Computation, International Symposium, ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, 3–6 August 2003, pp. 135–142 (2003)
Guruswami, V., Rudra, A.: Explicit codes achieving list decoding capacity: error-correction with optimal redundancy. IEEE Trans. Inf. Theory 54(1), 135–150 (2008)
Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45(6), 1757–1767 (1999)
Halikias, G., Galanis, G., Karcanias, N., Milonidis, E.: Nearest common root of polynomials, approximate greatest common divisor and the structured singular value. IMA J. Math. Control Inf. 30(4), 423–442 (2013)
Hough, D.G.: Explaining and ameliorating the ILL condition of zeros of polynomials. Ph.D. thesis (1977). AAI7731401
Howgrave-Graham, N.: Approximate integer common divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 51–66. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44670-2_6
Hribernig, V., Stetter, H.J.: Detection and validation of clusters of polynomial zeros. J. Symb. Comput. 24(6), 667–681 (1997)
Kailath, T.: Linear Systems, vol. 156. Prentice-Hall, Englewood Cliffs (1980)
Kaltofen, E., Yang, Z., Zhi, L.: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp. 169–176. ACM (2006)
Karmarkar, N.K., Lakshman, Y.N.: On approximate GCDs of univariate polynomials. J. Symb. Comput. 26(6), 653–666 (1998)
Lenstra, A.K., Lenstra, H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515–534 (1982)
Morrison, K.E.: Random polynomials over finite fields. https://web.calpoly.edu/~kmorriso/Research/RPFF.pdf
Mulders, T., Storjohann, A.: On lattice reduction for polynomial matrices. J. Symb. Comput. 35(4), 377–401 (2003)
Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, STOC 1999, New York, NY, USA, pp. 245–254. ACM (1999)
Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146–180. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44670-2_12
Noda, M.-T., Sasaki, T.: Approximate GCD and its application to ill-conditioned equations. J. Comput. Appl. Math. 38(1–3), 335–351 (1991)
Pan, V.Y.: Numerical computation of a polynomial GCD and extensions. Ph.D. thesis, Inria (1996)
Parvaresh, F., Vardy, A.: Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In: Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 October 2005, Pittsburgh, PA, USA, pp. 285–294 (2005)
Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, New York, NY, USA, pp. 84–93. ACM (2005)
Schönhage, A.: Quasi-GCD computations. J. Complex. 1(1), 118–137 (1985)
van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24–43. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_2
Winkler, J.R., Yang, N.: Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials. Comput. Aided Geom. Des. 30(4), 410–429 (2013)
Acknowledgments
The authors would like to thank the anonymous reviewers for their helpful comments and suggestions. This work was supported by the National Natural Science Foundation of China (Grants 61732021, 61502488). J. Xu is supported by Introducing Excellent Young Talents of Institute of Information Engineering, Chinese Academy Sciences and China Scholarship Council (No. 201804910206). S. Sarkar thanks Department of Science & Technology, India for partial support.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Xu, J., Sarkar, S., Hu, L. (2019). Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial Reconstruction. In: Hao, F., Ruj, S., Sen Gupta, S. (eds) Progress in Cryptology – INDOCRYPT 2019. INDOCRYPT 2019. Lecture Notes in Computer Science(), vol 11898. Springer, Cham. https://doi.org/10.1007/978-3-030-35423-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-35423-7_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-35422-0
Online ISBN: 978-3-030-35423-7
eBook Packages: Computer ScienceComputer Science (R0)