Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields

Now algorithms are presented for computing the minimal polynomial over a finite field K of a given element in an algebraic extension of K of the form K[α] or K[α][β]. The new algorithms are explicit and can be implemented rather easily in terms of polynomial multiplication, and are much more efficient than other algorithms in the literature.