A decoding algorithm for Gabidulin codes (defined over Fqm) is shown that directly provides the evaluation polynomial using an equivalent of the Euclidean Algorithm. To obtain low complexity, a fast symbolic product and a fast symbolic division are presented. The achieved complexity of the whole decoding algorithm for Gabidulin codes is O(m3 log m) operations over the ground field Fq.