Abstract
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is the same as the number of unknowns n the best known algorithms are exhaustive search for small fields, and a Gröbner base algorithm for large fields. Gröbner base algorithms have large exponential complexity and cannot solve in practice systems with n ≥ 15. Kipnis and Shamir [9] have recently introduced a new algorithm called “relinearization”. The exact complexity of this algorithm is not known, but for sufficiently overdefined systems it was expected to run in polynomial time.
In this paper we analyze the theoretical and practical aspects of relinearization. We ran a large number of experiments for various values of n and m, and analysed which systems of equations were actually solvable. We show that many of the equations generated by relinearization are linearly dependent, and thus relinearization is less efficient that one could expect. We then develop an improved algorithm called XL which is both simpler and more powerful than relinearization. For all 0 < ε ≤ 1/2, and m ≥ εn 2, XL and relinearization are expected to run in polynomial time of approximately \( n^{\mathcal{O}(1/\sqrt \varepsilon )} \). Moreover, we provide strong evidence that relinearization and XL can solve randomly generated systems of polynomial equations in subexponential time when m exceeds n by a number that increases slowly with n.
An extended version of this paper is available from the authors.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Iyad A. Ajwa, Zhuojun Liu, and Paul S. Wang: “Grobner Bases Algorithm”, ICM Technical Reports, February 1995. See http://symbolicnet.mcs.kent.edu/icm/reports/index1995.html.
Don Coppersmith: “Finding a small root of a univariate modular equation”; Proceedings of Eurocrypt’96, Springer-Verlag, pp.155–165.
Nicolas Courtois “The security of HFE”, to be published.
Nicolas Courtois: The HFE cryptosystem web page. See http://www.univ-tln.fr/~courtois/hfe.html
Jean-Charles Faugère: “A new efficient algorithm for computing Gröbner bases (F4).” Journal of Pure and Applied Algebra 139 (1999) pp. 61–88. See http://www.elsevier.com/locate/jpaa
Jean-Charles Faugère: “Computing Gröbner basis without reduction to 0”, technical report LIP6, in preparation, source: private communication.
Rudolf Lidl, Harald Niederreiter: “Finite Fields”; Encyclopedia of Mathematics and its applications, Volume 20, Cambridge University Press.
Aviad Kipnis, Jacques Patarin, Louis Goubin: “Unbalanced Oil and Vinegar Signature Schemes”; Eurocrypt 1999, Springer-Verlag, pp. 216–222.
Aviad Kipnis, Adi Shamir: “Cryptanalysis of the HFE Public Key Cryptosystem”; Proceedings of Crypto’99, Springer-Verlag.
Neal Koblitz: “Algebraic aspects of cryptography”; Springer-Verlag, ACM3, 1998, Chapter 4 “Hidden Monomial Cryptosystems”, pp. 80–102.
Jacques Patarin: “Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms”; Eurocrypt’96, Springer Verlag, pp. 33–48. An extended up-to-date version can be found at http://www.univ-tln.fr/~courtois/hfe.ps
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courtois, N., Klimov, A., Patarin, J., Shamir, A. (2000). Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. In: Preneel, B. (eds) Advances in Cryptology — EUROCRYPT 2000. EUROCRYPT 2000. Lecture Notes in Computer Science, vol 1807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45539-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-45539-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67517-4
Online ISBN: 978-3-540-45539-4
eBook Packages: Springer Book Archive