 We then need to successively compute GCDs of the form above until we find a non-trivial factor.Since the ring of polynomials over a field is a Euclidean domain, we may compute these GCDs using the Euclidean algorithm.One important application of Berlekamp's algorithm is in computing discrete logarithms over finite fields formula_40, where formula_41 is prime and formula_42.