About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISSAC 1999
Conference paper
Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields
Abstract
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.