Arithmetic in finite fields of 2^k elements is extremely important in cryptography, and thus it is just as important to be able to verify that these computations are being performed correctly by a given circuit. This paper aims to introduce the reader to Gröbner bases and their applications in the formal verification of Galois field arithmetic circuits.
