Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields

Victor Shoup

doi:10.1145/309831.309859

Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields

Victor Shoup

Computer Science

Research output: Contribution to conference › Paper › peer-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 language	English (US)
Pages	53-58
Number of pages	6
DOIs	https://doi.org/10.1145/309831.309859
State	Published - 1999
Event	Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC'99) - Vancouver, Can Duration: Jul 29 1999 → Jul 31 1999

Conference

Conference	Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC'99)
City	Vancouver, Can
Period	7/29/99 → 7/31/99

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1145/309831.309859

Cite this

@conference{07b55a6252e14d9c82674c1e02df0b35,

title = "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.",

author = "Victor Shoup",

note = "Publisher Copyright: {\textcopyright} 1999 ACM.; Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC'99) ; Conference date: 29-07-1999 Through 31-07-1999",

year = "1999",

doi = "10.1145/309831.309859",

language = "English (US)",

pages = "53--58",

}

TY - CONF

T1 - Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields

AU - Shoup, Victor

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0346163812&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346163812&partnerID=8YFLogxK

U2 - 10.1145/309831.309859

DO - 10.1145/309831.309859

M3 - Paper

AN - SCOPUS:0346163812

SP - 53

EP - 58

T2 - Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC'99)

Y2 - 29 July 1999 through 31 July 1999

ER -

Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this