Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields

Research output: Contribution to conferencePaperpeer-review

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.

Original languageEnglish (US)
Pages53-58
Number of pages6
DOIs
StatePublished - 1999
EventProceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC'99) - Vancouver, Can
Duration: Jul 29 1999Jul 31 1999

Conference

ConferenceProceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC'99)
CityVancouver, Can
Period7/29/997/31/99

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields'. Together they form a unique fingerprint.

Cite this