An algebraic attack on a cryptosystem consists of transforming the problem into the solution of a system of polynomial equations, usually over a finite field. The paper ``Algebraic attacks using SAT-solvers'' discusses different ways to efficiently transform the polynomial system into a logical clause. These CNF-clauses are then attackable using SAT-solvers. The authors also consider the sub-problem of efficiently reducing systems in fields of size a power of two to the Boolean field. The paper shows experimentally that using SAT-solvers to attack cryptosystems is feasible. It outperforms Gröbner basis methods by orders of magnitude.