On Implementing the Symbolic Preprocessing Function over Boolean Polynomial Rings in Gr?bner Basis Algorithms Using Linear Algebra  

作　　者：SUN Yao HUANG Zhenyu LIN Dongdai WANG Dingkang 

机构地区：[1]SKLOIS, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China. [2]KLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100090, China.

出　　处：《Journal of Systems Science & Complexity》2016年第3期789-804,共16页系统科学与复杂性学报（英文版）

基　　金：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;IEE’s Research Project on Cryptography under Grant Nos.Y3Z0013102,Y3Z0018102,and Y4Z0061A02

摘　　要：Some techniques using linear algebra was introduced by Faugore in F4 to speed up the reduction process during Grobner basis computations. These techniques can also be used in fast implementations of F5 and some other signature-based Grobner 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.

关 键 词：Boolean polynomial rings GrSbner basis implementation linear algebra. 

分 类 号：O151.1[理学—数学]