Complexity of Gröbner basis computation for Semi-regular Overdetermined sequences over F_2 with solutions in F_2

We present complexity results for solving "typical"overdetermined algebraic systems over GF(2) with solutions in GF(2) using Gröbner bases. They are useful for instance to predictthe complexity of an algebraic cryptanalysis over a cryptosystem,they give a priori upper bounds. We define semi-regularsequences and their associated notion of degree of regularity Dreg.The motivation for studying semi-regular sequences is that"random" sequences are semi-regular, and Dreg is closely related tothe global cost of the Gröbner basis computation for a gradedadmissible monomial order. Using inparticular the F5 Gröbner basis algorithm, we show that forsemi-regular sequences the behavior of F5 (in a matrix version)can be followed step by step, and the size of all matrices madeexplicit. We deduce Dmax, and using asymptotic analysis methodswe compute its asymptotic expansion. We give many explicitexamples, and discuss the complexity of the global arithmeticcost of the Gröbner basis computation for m quadratic equations in n variables: for m=N n with N constant, the computationis exponential, if