On the Complexity of Solving Quadratic Boolean Systems

Magali Bardet, Jean-Charles Faugère, Bruno Salvy +1

A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over ${\mathbb{F}}_2$. The cryptanalysis of several modern cip…