Abstract
Solving multivariate systems of polynomial equations is an important problem both as a subroutine in many problems and in its own right. Currently, the most efficient solvers are the Gröbner-basis solvers, which include the XL algorithm [6], as well as F\(_4\) [9] and F\(_5\) [10] algorithms. The F\(_4\) is an advanced algorithm for computing Gröbner bases. However, the algorithm has exponential space complexity and does not provide much flexibility in terms of controlling memory usage. This poses a serious challenge when we want to use it to solve instances of sizes of practical interest.
In this paper, we address the issue of memory usage by proposing a variant of F\(_4\) algorithm called YAGS (Yet Another Gröbner-basis Solver). YAGS uses less memory than the original algorithm and runs at comparable speed with F\(_4\). Furthermore, YAGS runs even faster than F\(_4\) when solving dense polynomial systems. In other words, the proposed algorithm can reach better time-memory compromise via deliberately designed techniques to control its memory usage and efficiency. We have implemented a prototype of YAGS and conducted an extensive set of experiments with it. The experiment results demonstrate that the proposed modification does achieve lower time-memory products than the original F\(_4\) over a broad set of parameters and problem sizes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Brickenstein, M., Dreyer, A., Greuel, G.M., Wedler, M., Wienand, O.: New developments in the theory of Gröbner bases and applications to formal verification. J. Pure Appl. Algebra 213(8), 1612–1635 (2009)
Buchberger, B.: An algorithm for finding the bases elements of the residue class ring modulo a zero dimensional polynomial ideal (German). Ph.D. thesis, Univ. of Innsbruck (1965)
Buchberger, B.: An algorithmical criterion for the solvability of algebraic systems (German). Aequationes Math. 4(3), 374–383 (1970)
Buchberger, B.: Gröbner bases: an algorithmic method in polynomial ideal theory. In: Bose, N.K. (ed.) Multidimensional Systems Theory, chap. 6, pp. 184–232. Reidel Publishing Company, Dodrecht (1985)
Condrat, C., Kalla, P.: A Gröbner basis approach to CNF-formulae preprocessing. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 618–631. Springer, Heidelberg (2007)
Courtois, N.T., Klimov, A.B., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392–407. Springer, Heidelberg (2000)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 3rd edn. Springer, Heidelberg (2007)
Faugère, J.-C., Perret, L., Petit, C., Renault, G.: Improving the complexity of index calculus algorithms in elliptic curves over binary fields. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 27–44. Springer, Heidelberg (2012)
Faugère, J.C.: A new efficient algorithm for computing Gröbner bases (F\(_4\)). J. Pure Appl. Algebra 139(1–3), 61–88 (1999)
Faugère, J.C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F\(_5\)). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002, pp. 75–83. ACM, New York (2002)
Faugère, J.-C., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44–60. Springer, Heidelberg (2003)
Huang, Y.-J., Petit, C., Shinohara, N., Takagi, T.: Improvement of Faugère et al.’s method to solve ECDLP. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 115–132. Springer, Heidelberg (2013)
Ikegami, D., Kaji, Y.: Maximum likelihood decoding for linear block codes using Gröbner bases. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 1(3), 643–651 (2003)
Joux, A., Vitse, V.: A variant of the F4 algorithm. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 356–375. Springer, Heidelberg (2011)
Lin, Z., Xu, L., Bose, N.K.: A tutorial on Gröbner bases with applications in signals and systems. IEEE Trans. Circ. Syst. 55(1), 445–461 (2008)
Merlet, J.P.: Polynomial systems. http://www-sop.inria.fr/coprin/logiciels/ALIAS/Benches/node1.html
Mora, T., Sala, M.: On the Gröbner bases of some symmetric systems and their application to coding theory. J. Symbolic Comput. 35(2), 177–194 (2003)
Petit, C., Quisquater, J.-J.: On polynomial systems arising from a Weil descent. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 451–466. Springer, Heidelberg (2012)
Saints, K., Heegard, C.: Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Gröbner bases. IEEE Trans. Inf. Theory 41(6), 1733–1751 (1995)
Wienand, O., Wedler, M., Stoffel, D., Kunz, W., Greuel, G.-M.: An algebraic approach for proving data correctness in arithmetic data paths. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 473–486. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Huang, YJ., Hong, WC., Cheng, CM., Chen, JM., Yang, BY. (2015). A Memory Efficient Variant of an Implementation of the F\(_4\) Algorithm for Computing Gröbner Bases. In: Yung, M., Zhu, L., Yang, Y. (eds) Trusted Systems. INTRUST 2014. Lecture Notes in Computer Science(), vol 9473. Springer, Cham. https://doi.org/10.1007/978-3-319-27998-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-27998-5_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27997-8
Online ISBN: 978-3-319-27998-5
eBook Packages: Computer ScienceComputer Science (R0)