New algorithms for generating Conway polynomials over finite fields

Journal of Symbolic Computation

Volumn 38, Issue 2, 2004, Pages 1003-1024

  Heath, Lenwood S ^a   Loehr, Nicholas A ^b  

^a Virginia Polytechnic Institute and State University   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Computer algebra; Conway polynomials; Finite fields; GAP; Magma

Indexed keywords

EID: 3242703416     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2004.03.002     Document Type: Article

References (11)

1. Bach E. Shallit J. Algorithmic Number Theory 1996 The MIT Press Cambridge, MA
2. Bosma W. Cannon J. Playoust C. The Magma algebra system I: The user language J. Symbolic Comput. 24 3-4 1997 235-265
3. Grabmeier J. Scheerhorn A. 1992. Finite fields in AXIOM Online document available at http://citeseer.nj.nec.com/121340.html
4. Heath L.S. Loehr N.A. Efficient algorithms for finding Conway polynomials Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms 1999 429-437
5. Heath L.S., Loehr N.A., 1998. New algorithms for generating Conway polynomials over finite fields. Tech. Rep. TR 98-14, Department of Computer Science, Virginia Polytechnic Institute and State University
6. Jansen C. Lux K. Parker R. Wilson R. An Atlas of Brauer Characters 1995 Clarendon Press Oxford
7. Lidl R. Niederreiter H. Introduction to Finite Fields and Their Applications 1994 Cambridge University Press Cambridge
8. Nickel W., 1988. Endliche Körper in dem gruppentheoretischen Programmsystem GAP. Diploma Thesis, RWTH Aachen
9. Parker R., 1990. Finite fields and Conway polynomials. Attributed in Scheerhorn to a talk given at IBM Heidelberg Scientific Center
10. Rotman J. Advanced Modern Algebra 2002 Prentice-Hall Upper Saddle River, NJ
11. Scheerhorn A. Trace- and norm-compatible extensions of finite fields Appl. Algebra Engrg. Comm. Comput. 3 1992 199-209