Computer Science Technical Reports
CS at VT

New Algorithms for Generating Conway Polynomials over Finite Fields

Heath, Lenwood S and Loehr, Nicholas A (1998) New Algorithms for Generating Conway Polynomials over Finite Fields. Technical Report ncstrl.vatech_cs//TR-98-14, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
Postscript - Requires a viewer, such as GhostView (240392)


Arithmetic in a finite field of prime characteristic p normally employs an irreducible polynomial in Z_p[X]. A particular class of irreducible polynomials, generally known as Conway polynomials, provides a means for representing several finite fields of characteristic p in a compatible manner. Conway polynomials are used in computational algebra systems such as GAP and Magma to represent finite fields. The generation of the Conway polynomials for a particular finite field has previously been done by an often expensive brute force search. As a consequence, only a few Conway polynomials have been generated. We present two algorithms for generating Conway polynomials that avoid the brute force search. We have implemented one of these algorithms in Magma and present numerous new Conway polynomials that implementation generated.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:493
Deposited By:User autouser
Deposited On:05 December 2001
Alternative Locations: URL:, URL: