In the late 1990s Jean–Charles Faugere introduced an algorithm for computing Groebner bases which is a lot faster than the traditional Buchberger algorithm. I will describe the major ideas behind this algorithm and my implementation of it in Magma, and how it can be applied to several types of problems, including cracking the HFE cryptosystem.