Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Some techniques using linear algebra was introduced by Faugère in F4 to speed up the reduction process during Gröbner basis computations. These techniques can also be used in fast implementations of F5 and some other signature-based Gröbner basis algorithms. When these techniques are applied, a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function (given in F4). Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function, this step can be very costly when the number of involved polynomials/monomials is huge. In this paper, multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported. Many examples have been tested by using this method, and the experimental data shows that the new method is very efficient.

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

References

  1. Buchberger B, Ein algorithmus zum auffinden der basiselemente des restklassenringes nach einem nulldimensionalen Polynomideal, PhD thesis, 1965.

    Google Scholar 

  2. Lazard D, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, Proc. EUROCAL’83, Lect. Notes in Comp. Sci., 1983, 162: 146–156.

    Article  MathSciNet  MATH  Google Scholar 

  3. Faugère J C, A new effcient algorithm for computing Gröbner bases (F 4), J. Pure Appl. Algebra, 1999, 139(1–3): 61–88.

    Article  MathSciNet  MATH  Google Scholar 

  4. Courtois N, Klimov A, Patarin J, and Shamir A, Efficient algorithms for solving overdefined systems of multivariate polynomial equations, Proc. of EUROCRYPT’00, Lect. Notes in Comp. Sci., 2000, 1807: 392–407.

    Article  MathSciNet  MATH  Google Scholar 

  5. Ding J, Buchmann J, Mohamed M S E, Mohamed W S A E, and Weinmann R P, Mutant XL, Proc. SCC’08, 2008, 16–22.

    Google Scholar 

  6. Faugère J C, A new effcient algorithm for computing Gröbner bases without reduction to zero (F 5), Proc. ISSAC’02, ACM Press, 2002, 75–82, Revised version downloaded from fgbrs.lip6.fr/jcf/Publications/index.html.

    Google Scholar 

  7. Albrecht M and Perry J, F4/5, Preprint, arXiv:1006.4933v2 [math.AC], 2010.

    Google Scholar 

  8. Faugère J C and Rahmany S, Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases, Proc. ISSAC’09, ACM Press, New York, USA, 2009, 151–158.

    Google Scholar 

  9. Gao S H, Volny F, and Wang M S, A new algorithm for computing Gröbner bases, Cryptology ePrint Archive, Report 2010/641, 2010.

    Google Scholar 

  10. Sun Y, Lin D D, and Wang D K, An improvement over the GVW algorithm for inhomogeneous polynomial systems, Preprint arXiv:1404.1428, 2014.

    Google Scholar 

  11. Faugère J C and Joux A, Algebraci cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner bases, Proc. Advances in Cryptology - CRYPTO 2003, LNCS, Springer Berlin/Heidelberg, 2003, 2729: 44–60.

    MATH  Google Scholar 

  12. Cabarcas D, An implementation of Faugère’s F4 algorithm for computing Gröbner bases, Thesis, 2010.

    Google Scholar 

  13. Skiena S S, The Algorithm Design Manual, Second Edition, Springer, 2008.

    Book  MATH  Google Scholar 

  14. Faugère J C and Lachartre S, Parallel Gaussian elimination for Gröbner bases computations in finite fields, Proc. PASCO 2010, ACM Press, 2010, 89–97.

    Google Scholar 

  15. Albrecht M and Bard G, The M4RI Library — Version 20130416, 2013, http://m4ri.sagemath.org.

    Google Scholar 

  16. Courtois N, Benchmarking algebraic, logical and constraint solvers and study of selected hard problems, 2013, http://www.cryptosystem.net/aes/hardproblems.html.

    Google Scholar 

  17. Steel A, Allan Steel’s Gröbner basis timings page, 2004, http://magma.maths.usyd.edu.au/ allan/ gb/.

    Google Scholar 

  18. Li D, Liu J, Liu W, and Zheng L, GVW algorithm over principal ideal domains, Journal of Systems Science and Complexity, 2013, 26(4): 619–633.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SKLOIS, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China

    Yao Sun, Zhenyu Huang & Dongdai Lin

  2. KLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100090, China

    Dingkang Wang

Authors
  1. Yao Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenyu Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dongdai Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dingkang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhenyu Huang.

Additional information

This research is supported by the National Key Basic Research Program of China under Grant Nos. 2013CB834203 and 2011CB302400, the National Nature Science Foundation of China under Grant Nos. 11301523, 11371356, 61121062, the Strategic Priority Research Program of the Chinese Academy of Sciences under Grant No. XDA06010701, and IEE’s Research Project on Cryptography under Grant Nos. Y3Z0013102, Y3Z0018102, and Y4Z0061A02.

This paper was recommended for publication by Editor LI Ziming.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, Y., Huang, Z., Lin, D. et al. On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra. J Syst Sci Complex 29, 789–804 (2016). https://doi.org/10.1007/s11424-015-4085-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-015-4085-1

Keywords

Search

Navigation