@inproceedings{Camion:1987,
	key = "Camion 1987",
	author = "P. F. Camion",
	title = "An iterative {Euclidean} algorithm",
	booktitle = "AAECC-5",
	editor = "L. Huguet and A. Poli",
	year = 1987,
	series = LNICS,
	volume = 356,
	pages = "88-128"}

@article{Binet:1841,
	key = "Binet 1841",
	author = "J. P. M. Binet",
	title = "Recherches sur la th\'eorie des nombres entiers
et sur la r\'esolution de l'\'equation ind\'etermin\'ee du premier
degr\'e qui n'admet que des solutions enti\`eres",
	journal = JMPA,
	volume = 6,
	year = 1841,
	pages = "449-494"}

@article{Knopfmacher&Knopfmacher:1988,
	key = "Knopfmacher and Knopfmacher 1988",
	author = "A. Knopfmacher and J. Knopfmacher",
	title = "The exact length of the {Euclidean} algorithm in
                 {$\Ffield{q} [X]$}",
	journal = MATH,
	volume = 35,
	year = 1988,
	pages = "297-304"}

@article{Berlekamp:1970,
	key = "Berlekamp 1970",
	author = "E. R. Berlekamp",
	title = "Factoring polynomials over large finite fields",
	journal = MC,
	volume = 24,
	year = 1970,
	pages = "713-735"}

@article{Berlekamp:1967,
	key = "Berlekamp 1967",
	author = "E. R. Berlekamp",
	title = "Factoring polynomials over finite fields",
	journal = BSTJ,
	volume = 46,
	year = 1967,
	pages = "1853-1859"}

@article{Calmet&Loos:1980,
	key = "Calmet and Loos 1980",
	author = "J. Calmet and R. Loos",
	title = "An improvement of {Rabin's} probabilistic algorithm for
	generating irreducible polynomials over {$GF(p)$}",
	journal = IPL,
	volume = 11,
	year = 1980,
	pages = "94-95"}

@article{Zassenhaus:1969,
	key = "Zassenhaus 1969",
	author = "H. Zassenhaus",
	title = "On {Hensel} factorization, {I}",
	journal = JNT,
	volume = 1,
	year = 1969,
	pages = "291-311"}

@article{Cantor&Zassenhaus:1981,
	key = "Cantor and Zassenhaus 1981",
	author = "D. G. Cantor and H. Zassenhaus",
	title = "A new algorithm for factoring polynomials over finite
	fields",
	journal = MC,
	volume = 36,
	year = 1981,
	pages = "587-592"}

@incollection{Zassenhaus:1975,
	key = "Zassenhaus 1975",
	author = "H. Zassenhaus",
	title = "On {Hensel} factorization {II}",
	series = "Symposia Math.",
	volume = 15,
	publisher = AP,
	address = "London",
	year = 1975,
	pages = "499-513"}

@article{Zassenhaus:1978,
	key = "Zassenhaus 1978",
	author = "H. Zassenhaus",
	title = "A remark on the {Hensel} factorization method",
	journal = MC,
	volume = 32,
	year = 1978,
	pages = "287-292"}

@article{Rabin:1980a,
	key = "Rabin 1980a",
	author = "M. O. Rabin",
	title = "Probabilistic algorithms in finite fields",
	journal = SIAMJC,
	volume = 9,
	year = "{\noopsort{1980a}}1980",
	pages = "273-280"}

@article{Tonelli:1891,
	key = "Tonelli 1891",
	author = "A. Tonelli",
	title = {Bemerkung \"uber die {Aufl\"osung} quadratischer
{Congruenzen}},
	journal = GN,
	year = 1891,
	pages = "344-346"}

@article{Montgomery:1985,
	key = "P. Montgomery 1985",
	author = "P. L. Montgomery",
	title = "Modular multiplication without trial division",
	journal = MC,
	volume = 44,
	year = 1985,
	pages = "519-521"}

@inproceedings{Adleman&Manders&Miller:1977,
	key = "Adleman, Manders, and Miller 1977",
	author = "L. M. Adleman and K. Manders and G. L. Miller",
	title = "On taking roots in finite fields",
	booktitle = FOCS77,
	year = 1977,
	pages = "175-178"}

@inproceedings{vonzurGathen:1986a,
	key = "von zur Gathen 1986a",
	author = "Gathen, J. von zur",
	title = "Irreducible polynomials over finite fields",
	booktitle = "Foundations of Software Technology and Theoretical
Computer Science '86",
	series = LNICS,
	volume = 241,
	editor = "K. V. Nori",
	year = 1986,
	pages = "252-262"}

@article{Burgess:1957,
	key = "Burgess 1957",
	author = "D. A. Burgess",
	title = "The distribution of quadratic residues and non-residues",
	journal = MATH,
	volume = 4,
	year = 1957,
	pages = "106-112"}

@article{Burgess:1962a,
	key = "Burgess 1962a",
	author = "D. A. Burgess",
	title = "On character sums and primitive roots",
	journal = PLMS,
	volume = 12,
	series = 3,
	year = 1962,
	pages = "179-192"}

@article{Yeh&Reed&Truong:1984,
	key = "Yeh, Reed, and Truong 1984",
	author = "C.-S. Yeh and I. S. Reed and T. K. Truong",
	title = "Systolic multipliers for finite fields ${GF(2^m)}$",
	journal = IEEE-TC,
	volume = "C-33",
	year = 1984,
	pages = "357-360"}

@misc{Omura&Massey:1986,
	key = "Omura and Massey 1986",
	author = "J. K. Omura and J. L. Massey",
	title = "Computational method and apparatus for finite field arithmetic",
	note = "U. S. patent 4,587,627; May 6, 1986; filed September 14, 1982"}

@misc{Onyszchuk&Mullin&Vanstone:1988,
	key = "Onyszchuk, Mullin, and Vanstone 1988",
	author = "I. M. Onyszchuk and R. C. Mullin and S. A. Vanstone",
	title = "Computational method and apparatus for finite field multiplication",
	note = "U. S. patent 4,745,568; May 17, 1988; filed May 30, 1985"}

@article{Thiong.Ly:1989a,
	key = "Thiong Ly 1989a",
	author = "{Thiong Ly}, J. A.",
	title = "A deterministic algorithm for factorizing polynomials
over extensions {$GF(p^m)$} of {$GF(p)$}, $p$ a small prime",
	journal = JIOS,
	volume = 10,
	year = "{\noopsort{1989a}}1989",
	pages = "337-344"}

@article{Wiedemann:1986,
	key = "Wiedemann 1986",
	author = "D. H. Wiedemann",
	title = "Solving sparse linear equations over finite fields",
	journal = IEEE-IT,
	volume = "IT-32",
	year = 1986,
	pages = "54-62"}

@article{Burgess:1967,
	key = "Burgess 1967",
	author = "D. A. Burgess",
	title = "On the quadratic character of a polynomial",
	journal = JLMS,
	volume = 42,
	year = 1967,
	pages = "73-80"}

@article{Ma&von.zur.Gathen:1990,
	key = "Ma and von zur Gathen 1990",
	author = "K. Ma and Gathen, J. von zur",
	title = "Analysis of {Euclidean} algorithms for polynomials over
		 finite fields",
	journal = JSC,
	volume = 9,
	year = 1990,
	pages = "429-455"}

@article{Madden:1981,
	key = "Madden 1981",
	author = "D. J. Madden",
	title = "Polynomials and primitive roots in
		 finite fields",
	journal = JNT,
	volume = 13,
	year = 1981,
	pages = "499-514"}

@article{Bach&Shoup:1990,
	key = "Bach and Shoup 1990",
	author = "E. Bach and V. Shoup",
	title = "Factoring polynomials using fewer random bits",
	journal = JSC,
	volume = 9,
	year = 1990,
	pages = "229-239"}

@article{Boyar&Frandsen&Sturtivant:1992,
	key = "Boyar, Frandsen, and Sturtivant 1992",
	author = "J. Boyar and G. Frandsen and C. Sturtivant",
	title = "An arithmetic model of computation equivalent to
threshold circuits",
	journal = TCS,
	volume = 93,
	year = 1992,
	pages = "303-319"}

@article{Car:1982,
	key = "Car 1982",
	author = "M. Car",
	title = "Factorisation dans {$\Fq[X]$}",
	journal = CRASP,
	volume = 294, 
	year = 1982,
	pages = "147-150"}

@article{DavenportH&Lewis:1963,
	key = "H. Davenport and Lewis 1963",
	author = "H. Davenport and D. J. Lewis",
	title = "Character sums and primitive roots in finite fields",
	journal = RCMP,
	volume = 12, 
	year = 1963,
	pages = "129-136"}

@incollection{HWLenstra:1990,
	key = "H. W. Lenstra 1990",
	author = "Lenstra, Jr., H. W.",
	title = "Algorithms for finite fields",
	booktitle = "Number Theory and Cryptography",
	editor = "J. H. Loxton",
	publisher = "Cambridge University Press",
	series = "London Mathematical Society Lecture Note Series",
	year = 1990,
	volume = 154,
	pages = "76-85"}

@article{vonzurGathen&Giesbrecht:1990,
	key = "von zur Gathen and Giesbrecht 1990",
	author = "Gathen, J. von zur and M. Giesbrecht",
	title = "Constructing normal bases in finite fields",
	journal = JSC,
	volume = 10,
	year = 1990,
	pages = "547-570"}

@article{Shparlinski:1991,
	key = "Shparlinski 1991",
	author = "I. E. Shparlinski",
	title = "On some problems in the theory of finite fields",
	journal = UMNAUK,
	volume = 46,
	number = 1,
	year = 1991,
	pages = "165-200",
	note = "In Russian.  English translation in {\it Russian Math.
Surveys} {\bf 46} (1) (1991), 199--240"}

@article{Knopfmacher:1991,
	key = "Knopfmacher 1991",
	author = "A. Knopfmacher",
	title = "The length of the continued fraction expansion for
a class of rational functions in {$\Ffield{q}(X)$}",
	journal = PEMS,
	volume = 34,
	year = 1991,
	pages = "7-17"}

@article{Shoup:1991a,
	key = "Shoup 1991a",
	author = "V. Shoup",
	title = "Smoothness and factoring polynomials over finite fields",
	journal = IPL,
	volume = 38,
	year = "{\noopsort{1991a}}1991",
	pages = "39-42"}

@incollection{Shoup:1991b,
	key = "Shoup 1991b",
	author = "V. Shoup",
	title = "A fast deterministic algorithm for factoring polynomials
over finite fields of small characteristic",
	booktitle = ISSAC91,
	editor = "S. M. Watt",
	publisher = "ACM Press",
	year = "{\noopsort{1991b}}1991",
	pages = "14-21"}

@inproceedings{Buchmann&Shoup:1991,
	key = "Buchmann and Shoup 1991",
	author = "J. Buchmann and V. Shoup",
	title = "Constructing nonresidues in finite fields and the extended
{Riemann} hypothesis",
	booktitle = STOC91,
	year = 1991,
	pages = "72-79"}

@phdthesis{vanOorschot:1988,
	key = "van Oorschot 1988",
	author = "Oorschot, P. C. van",
	title = "Combinatorial and computational issues related to finding
roots of polynomials over finite fields",
	school = "Department of Computer Science, University of Waterloo",
	year = 1988}

@article{Chen:1982,
	key = "C. Chen 1982",
	author = "C.-L. Chen",
	title = "Formulas for the solutions of quadratic equations over
{$GF(2^m)$}",
	journal = IEEE-IT,
	volume = "IT-28",
	year = 1982,
	pages = "792-794"}

@article{Althaus&Leake:1969,
	key = "Althaus and Leake 1969",
	author = "H. L. Althaus and R. J. Leake",
	title = "Inverse of a finite-field {V}andermonde matrix",
	journal = IEEE-IT,
	volume = "IT-15",
	year = 1969,
	pages = "173"
	}

@article{Chien&Cunningham&Oldham:1969,
	author = "R. T. Chien and B. D. Cunningham and I. B. Oldham",
	key = "Chien, Cunningham, and Oldman 1969",
	title = "Hybrid methods for finding roots of a polynomial
		 -- with application to {BCH} decoding",
	journal = IEEE-IT,
	volume = "IT-15",
	year = 1969,
	pages = "329-335"}

@article{Ananiashvili&Varshamov&Gorovoi&Parkhomenko:1966,
	author = "G. G. Ananiashvili and R. R. Varshamov and 
		  V. P. Gorovoi and P. P. Parkhomenko",
	key = "Ananiashvili, Varshamov, Gorovoi, and Parkhomenko 1966",
	title = "On the question of the decomposition of polynomials
		 over the field {$GF(2)$}",
	journal = "Soobshcheniya Akademii Nauk Gruzinsko{\u i} SSR",
	volume = 41,
	year = 1966,
	pages = "129-134",
	note = "In Russian with Georgian summary"}

@article{van.Oorschot&Vanstone:1990b,
	author = "Oorschot, P. C. van and S. A. Vanstone",
	key = "van Oorschot and Vanstone 1990b",
	title = "On splitting sets in block designs and finding
		 roots of polynomials",
	journal = DM,
	volume = 84,
	year = "{\noopsort{1990b}}1990",
	pages = "71-85"}

@inproceedings{Thiong.Ly:1989b,
	key = "Thiong Ly 1989b",
	author = "{Thiong Ly}, J. A.",
	title = "Note for computing the minimum polynomial of elements
		 in large finite fields",
	booktitle = "Coding Theory and Applications",
	editor = "G. Cohen and J. Wolfmann",
	year = "{\noopsort{1989b}}1989",
	series = LNICS,
	volume = 388,
	pages = "185-192"}

@article{Agou:1976,
	key = "Agou 1976",
	author = "S. Agou",
	title = "Factorisation des polyn{\^o}mes {\`a} coefficients
		 dans un corps fini",
	journal = "Publications du Dept. Math. Lyon",
	year = 1976,
	volume = 13,
	pages = "63-71"}

@article{Redei:1950,
	key = "R{\'e}dei 1950",
	author = "L. R{\'e}dei",
	title = "A short proof of a theorem of {{\u St.}} {S}chwartz
		 concerning finite fields",
	journal = CPMF,
	year = 1950,
	volume = 75,
	pages = "211-212"}

@article{Mignotte:1976a,
	key = "Mignotte 1976a",
	author = "M. Mignotte",
	title = "Factorisation des polyn{\^omes} sur un corps fini",
	journal = ASTER,
	year = "{\noopsort{1976a}1976}",
	volume = "38-39",
	pages = "149-157"}

@article{Laguerre:1867,
	key = "Laguerre 1867",
	author = "M. Laguerre",
	title = "Le calcul des syst{\`e}mes lin{\'e}aires",
	journal = JEPOLY,
	year = 1867,
	volume = 25,
	pages = "215-264",
	comment = "Gives Csanky's algorithm."}

@article{Hardman&Jordan:1969,
	key = "Hardman and Jordan 1969",
	author = "N. R. Hardman and J. H. Jordan",
	title = "The distribution of quadratic residues in 
		 fields of order {$P^2$}",
	journal = MM,
	year = 1969,
	volume = "42",
	pages = "12-17"}

@incollection{Trevisan&Wang:1991,
	key = "Trevisan and Wang 1991",
	author = "V. Trevisan and P. Wang",
	title = "Practical factorization of univariate polynomials over finite fields",
	editor = "S. M. Watt",
	booktitle = ISSAC91,
	publisher = "ACM Press",
	pages = "22-31",
	year = 1991}

@incollection{Beth&Geiselmann&Meyer:1991,
	key = "Beth, Geiselmann, and Meyer 1991",
	author = "T. Beth and W. Geiselmann and F. Meyer",
	title = "Finding (good) normal bases in finite fields",
	booktitle = ISSAC91,
	editor = "S. M. Watt",
	publisher = "ACM Press",
	pages = "173-178",
	year = 1991}

@article{Wan:1990,
	key = "Wan 1990",
	author = "D. Wan",
	title = "Factoring multivariate polynomials over large finite fields",
	journal = MC,
	volume = 54,
	year = 1990,
	pages = "755-770"}

@article{Lidl:1991,
	key = "Lidl 1991",
	author = "R. Lidl",
	title = "Computational problems in the theory of finite fields",
	journal = AAECC,
	volume = 2,
	year = 1991,
	pages = "81-89"}

@article{Shoup:1992,
	key = "Shoup 1992",
	author = "V. Shoup",
	title = "Searching for primitive roots in finite fields",
	journal = MC,
	volume = 58,
	year = 1992,
	pages = "369-380"}

@incollection{Rifa&Borrell:1991,
	key = "{Rif\`a} and Borrell 1991",
	author = "J. {Rif\`a} and J. Borrell",
	title = "Improving the time complexity of the computation
of irreducible and primitive polynomials in finite fields",
	booktitle = AAECC9,
	editor = "H. F. Mattson and T. Mora and T. R. N. Rao",
	publisher = SV,
	series = LNICS,
	volume = 539,
	year = 1991,
	pages = "352-359"}

@incollection{Kaltofen&Saunders:1991,
	key = "Kaltofen and Saunders 1991",
	author = "E. Kaltofen and B. D. Saunders",
	title = "On {Wiedemann's} method of solving sparse linear systems",
	booktitle = AAECC9,
	editor = "H. F. Mattson and T. Mora and T. R. N. Rao",
	publisher = SV,
	series = LNICS,
	volume = 539,
	year = 1991,
	pages = "29-38"}

@incollection{Stepanov&Shparlinski:1991,
	key = "Stepanov and Shparlinski 1991",
	author = "S. A. Stepanov and I. E. {\noopsort{Shparlinski}}Shparlinskiy",
	title = "On the construction of primitive elements and
primitive normal bases in a finite field",
	booktitle = "Computational Number Theory",
	editor = "A. {Peth\"o} and M. E. Pohst and H. C. Williams and
H. G. Zimmer",
	publisher = "Walter de Gruyter",
	address = "Berlin",
	year = 1991,
	pages = "1-14"}

@inproceedings{vonzurGathen:1991a,
	key = "von zur Gathen 1991a",
	author = "Gathen, J. von zur",
	title = "Efficient exponentiation in finite fields",
	booktitle = FOCS91,
	year = "{\noopsort{1991a}}1991",
	pages = "384-391"}

@article{vonzurGathen:1991b,
	key = "von zur Gathen 1991b",
	author = "Gathen, J. von zur",
	title = "Efficient and optimal exponentiation in finite fields",
	journal = CC,
	volume = 1,
	year = "{\noopsort{1991b}}1991",
	pages = "360-394"}

@article{vonzurGathen:1992,
	key = "von zur Gathen 1992",
	author = "Gathen, J. von zur",
	title = "Processor-efficient exponentiation in finite fields",
	journal = IPL,
	volume = 41,
	year = 1992,
	pages = "81-86"}

@article{Shoup:1990c,
	key = "Shoup 1990c",
	author = "V. Shoup",
	title = "New algorithms for finding irreducible polynomials over
finite fields",
	journal = MC,
	volume = 54,
	year = "{\noopsort{1990c}}1990",
	pages = "435-447"}

@article{Gerth:1986,
	key = "Gerth 1986",
	author = "F. Gerth III",
	title = "Limit probabilities for coranks of matrices over {$GF(q)$}",
	journal = LMA,
	volume = 19,
	year = 1986,
	pages = "79-93"}

@article{Goh&Schmutz:1991,
	key = "Goh and Schmutz 1991",
	author = "W. M. Y. Goh and E. Schmutz",
	title = "A central limit theorem on {$GL_n(F_q)$}",
	journal = RSTRUCT,
	volume = 2,
	year = 1986,
	pages = "79-93"}

@inproceedings{von.zur.Gathen&Shoup:1992a,
	key = "von zur Gathen and Shoup 1992a",
	author = "Gathen, J. von zur and Shoup, V.",
	title = "Computing {F}robenius maps and factoring polynomials",
	booktitle = STOC92,
	publisher = ACM,
	year = "{\noopsort{1992a}}1992",
	pages = "97-105"}

@article{von.zur.Gathen&Shoup:1992b,
	key = "von zur Gathen and Shoup 1992b",
	author = "Gathen, J. von zur and Shoup, V.",
	title = "Computing {Frobenius} maps and factoring polynomials",
	journal = CC,
	volume = 2,
	year = "{\noopsort{1992b}}1992",
	pages = "187-224"}

@article{Huber:1992,
	key = "Huber 1992",
	author = "K. Huber",
	title = "Solving equations in finite fields and some results concerning
the structure of {$GF(p^m)$}",
	journal = IEEE-IT,
	volume = 38,
	year = 1992,
	pages = "1154-1162"}

@incollection{LaMacchia&Odlyzko:1991c,
	key = "LaMacchia and Odlyzko 1991c",
	author = "B. A. LaMacchia and A. M. Odlyzko",
	title = "Solving large sparse linear systems over finite fields",
	booktitle = CRYPTO90,
	editor = "A. J. Menezes and S. A. Vanstone",
	publisher = SV,
	year = "{\noopsort{1991c}}1991",
	series = LNICS,
	volume = 537,
	pages = "109-133"}

@article{CohenS:1992,
	key = "S. Cohen 1992",
	author = "S. D. Cohen",
	title = "The explicit contruction of irreducible polynomials
over finite fields",
	journal = DCC,
	volume = 2,
	year = 1992,
	pages = "169-174"}

@incollection{Litow&Davida:1988,
	key = "Litow and Davida 1988",
	author = "B. E. Litow and G. I. Davida",
	title = "{$O(\log(n))$} parallel time finite field inversion",
	booktitle = AWOC88,
	editor = "J. H. Reif",
	publisher = SV,
	series = LNICS,
	volume = 319,
	year = 1988,
	pages = "74-80"}

@article{Swan:1962,
	key = "Swan 1962",
	author = "R. Swan",
	title = "Factorization of polynomials over finite fields",
	journal = PJM,
	volume = 12,
	year = 1962,
	pages = "1099-1106"}

@inproceedings{Shoup:1993a,
	key = "Shoup 1993a",
	author = "V. Shoup",
	title = "Fast construction of irreducible polynomials over finite
fields",
	booktitle = SODA93,
	year = "{\noopsort{1993a}}1993",
	publisher = ACM,
	pages = "484-492"}

@article{Shoup:1994,
	key = "Shoup 1994",
	author = "V. Shoup",
	title = "Fast construction of irreducible polynomials over finite
fields",
	journal = JSC,
	volume = 17,
	year = 1994,
	pages = "371-391"}

@article{Niederreiter:1993a,
	key = "Niederreiter 1993a",
	author = "H. Niederreiter",
	title = "A new efficient factorization algorithm for polynomials
over small finite fields",
	journal = AAECC,
	volume = 4,
	year = "{\noopsort{1993a}}1993",
	pages = "81-87"}

@incollection{Niederreiter:1993b,
	key = "Niederreiter 1993b",
	author = "H. Niederreiter",
	title = "Finite fields and cryptology",
	booktitle = "Finite Fields, Coding Theory, and Advances in Communications and
Computing",
	series = "Lecture Notes in Pure and Applied Mathematics",
	volume = 141,
	editor = "G. L. Mullen and P. J.-S. Shiue",
	year = "{\noopsort{1993b}}1993",
	publisher = "Marcel Dekker",
	address = "New York",
	pages = "359-373"}

@incollection{Niederreiter:1993c,
	key = "Niederreiter 1993c",
	author = "H. Niederreiter",
	title = "Recent advances in the theory of finite fields",
	booktitle = "Finite Fields, Coding Theory, and Advances in Communications and
Computing",
	series = "Lecture Notes in Pure and Applied Mathematics",
	volume = 141,
	editor = "G. L. Mullen and P. J.-S. Shiue",
	year = "{\noopsort{1993c}}1993",
	publisher = "Marcel Dekker",
	address = "New York",
	pages = "153-163"}

@article{CohenS:1990,
	key = "S. Cohen 1990",
	author = "S. D. Cohen",
	title = "The factorable core of polynomials over finite fields",
	journal = JAMSA,
	volume = 49,
	year = 1990,
	pages = "309-318"}

@incollection{Pinch:1992,
	key = "Pinch 1992",
	author = "R. G. E. Pinch",
	title = "Recognising elements of finite fields",
	booktitle = "Cryptography and Coding II",
	editor = "C. Mitchell",
	publisher = "Clarendon Press",
	address = "Oxford",
	year = 1992,
	series = "Institute of Mathematics and its Applications Conference Series",
	volume = 33,
	pages = "193-197"}

@article{Shparlinski:1993a,
	key = "Shparlinski 1993a",
	author = "I. E. Shparlinski",
	title = "On bivariate polynomial factorization over finite fields",
	journal = MC,
	volume = 60,
	year = "{\noopsort{1993a}}1993",
	pages = "787-791"}

@article{McEliece&Shearer:1978,
	key = "McEliece and Shearer 1978",
	author = "R. J. McEliece and J. B. Shearer",
	title = "A property of Euclid's algorithm and an application
		 to Pad{\'e} approximation",
	journal = SIAMJAM,
	volume = 34,
	year = 1978,
	pages = "611-615"}

@unpublished{Frandsen:1991a,
	key = "Frandsen 1991a",
	author = "G. Frandsen",
	title = "Parallel construction of irreducible polynomials",
	year = "{\noopsort{1991a}}1991",
	note = "Unpublished manuscript"}

@techreport{Frandsen:1991b,
	key = "Frandsen 1991b",
	author = "G. S. Frandsen",
	title = "Probabilistic construction of normal basis",
	year = "{\noopsort{1991b}}1991",
	institution = "Computer Science Dept., Aarhus Univ.",
	number = 361,
	month = "August"}

@inproceedings{Davida&Litow:1985,
	key = "Davida and Litow 1985",
	author = "G. I. Davida and B. E. Litow",
	title = "Fast parallel inversion in finite fields",
	booktitle = "Proceedings of the 19th Annual Conference on 
                     Information Sciences and Systems",
	year = 1985,
	publisher = "Dept. of EECS, Johns Hopkins University",
	pages = "305-308"}

@article{Sturtivant&Frandsen:1993,
	key = "Sturtivant and Frandsen 1993",
	author = " C. Sturtivant and G. S. Frandsen",
	title = "The computational efficacy of finite field arithmetic",
	journal = TCS,
	volume = 112,
	pages = "291-309",
	year = 1993}

@article{Car:1988,
	key = "Car 1988",
	author = "M. Car",
	title = "Un probl{\`e}me de diviseurs dans {$\Fq[X]$}",
	journal = AA,
	volume = 50, 
	year = 1988,
	pages = "147-150"}

@article{Car:1987,
	key = "Car 1987",
	author = "M. Car",
	title = "Th{\'e}or{\`e}mes de densit{\'e} dans {$\Fq[X]$}",
	journal = AA,
	volume = 50, 
	year = 1987,
	pages = "145-165"}

@incollection{Niederreiter:1991,
	key = "Niederreiter 1991",
	author = "H. Niederreiter",
	title = "Finite fields and their applications",
	booktitle = "Contributions to General Algebra 7",
	editor = "D. Dorninger",
	publisher = "H{\"o}lder--Pichler--Tempsky",
	address = "Vienna",
	year = 1991,
	pages = "251-264"}

@article{Slisenko:1981,
	key = "Slisenko 1981",
	author = "A. O. Slisenko",
	title = "Complexity problems in computational theory",
	journal = UMNAUK,
	volume = 36,
	number = 6,
	year = 1981,
	pages = "21-103",
	note = "In Russian.  English translation in {\it Russian Math.
Surveys} {\bf 36} (1981), 23--125"}

@article{Shparlinski:1993b,
	key = "Shparlinski 1993b",
	author = "I. E. Shparlinski",
	title = "Finding irreducible and primitive polynomials",
	journal = AAECC,
	volume = 4,
	year = "{\noopsort{1993b}}1993",
	pages = "263-268"}

@incollection{Karpinski:1991,
	key = "Karpinski 1991",
	author = "M. Karpinski",
	title = "Approximation algorithms for counting problems in
finite fields",
	booktitle = FCT91,
	series = LNICS,
	editor = "L. Budach",
	volume = 529,
	year = 1991,
	publisher = SV,
	address = NY,
	pages = "45-46"}

@article{WilliamsK&Hardy:1993,
	key = "K. Williams and Hardy 1993",
	author = "K. S. Williams and K. Hardy",
	title = "A refinement of {H. C. Williams'} $q$th root algorithm",
	journal = MC,
	volume = 61,
	year = 1993,
	pages = "475-483"}

@article{DiPorto&Guida&Montolivo:1992,
	key = "Di Porto, Guida, and Montolivo 1992",
	author = "Porto, A. Di and F. Guida and E. Montolivo",
	title = "Fast algorithm for finding primitive polynomials
over {$GF(q)$}",
	journal = ELETT,
	volume = 28,
	year = 1992,
	pages = "118-120"}

@article{Knopfmacher&Knopfmacher:1993,
	key = "Knopfmacher and Knopfmacher 1993",
	author = "A. Knopfmacher and J. Knopfmacher",
	title = "Counting irreducible factors of polynomials over
a finite field",
	journal = DM,
	volume = 112,
	year = 1993,
	pages = "103-118"}

@article{Niederreiter&Gottfert:1993,
	key = "Niederreiter and {G\"ottfert} 1993",
	author = "H. Niederreiter and R. {G\"ottfert}",
	title = "Factorization of polynomials over finite fields
and characteristic sequences",
	journal = JSC,
	volume = 16,
	year = 1993,
	pages = "401-412"}

@inproceedings{Evdokimov:1994,
	key = "Evdokimov 1994",
	author = "S. A. Evdokimov",
	title = "Factorization of polynomials over finite fields
in subexponential time under {GRH}",
	booktitle = ANTS1,
	year = 1994,
	publisher = SV,
	series = LNICS,
	volume = 877,
	editor = "L. M. Adleman and M.-D. Huang",
	pages = "209-219",
	comment = "Actual author was S. Evdokimov"}

@article{Niederreiter:1994a,
	key = "Niederreiter 1994a",
	author = "H. Niederreiter",
	title = "Factoring polynomials over finite fields using
differential equations and normal bases",
	journal = MC,
	volume = 62,
	year = "{\noopsort{1994a}}1994",
	pages = "819-830"}

@article{Gottfert:1994,
	key = "{G\"ottfert} 1994",
	author = "R. {G\"ottfert}",
	title = "An acceleration of the {Niederreiter} factorization
algorithm in characteristic 2",
	journal = MC,
	volume = 62,
	year = 1994,
	pages = "831-839"}

@unpublished{Ma&von.zur.Gathen:1994a,
	key = "Ma and von zur Gathen 1994a",
	author = "K. Ma and Gathen, J. von zur",
	title = "Tests for permutation functions",
	year = "{\noopsort{1994a}}1994",
	note = "To appear, {\it Finite Fields Appls.}"}

@inproceedings{Ma&von.zur.Gathen:1994b,
	key = "Ma and von zur Gathen 1994b",
	author = "K. Ma and Gathen, J. von zur",
	title = "The computational complexity of recognizing permutation functions",
	year = "{\noopsort{1994b}}1994",
	booktitle = STOC94,
	publisher = ACM,
	pages = "392-401"}

@inproceedings{Shoup:1993b,
	key = "Shoup 1993b",
	author = "V. Shoup",
	title = "Factoring polynomials over finite fields: asymptotic 
complexity vs. reality",
	booktitle = "Proc. IMACS Symposium (Lille, France)",
	year = "{\noopsort{1993b}}1993"}

@article{Serra&Slater:1990,
	key = "Serra and Slater 1990",
	author = "M. Serra and T. Slater",
	title = "A {L}anczos algorithm in a finite field and its application",
	journal = JCMCC,
	volume = 7,
	year = 1990,
	pages = "11-32"}

@inproceedings{Ma&von.zur.Gathen:1993,
	key = "Ma and von zur Gathen 1993",
	author = "K. Ma and Gathen, J. von zur",
	title = "Counting value sets of functions and testing permutation
		 functions",
	booktitle = "Number Theoretic and Algebraic Methods in Computer 
		     Science",
	year = 1993,
	city = "Moscow",
	publisher = "Intern. Centre Sci. Tech. Inform."}

@inproceedings{Giesbrecht:1992a,
	key = "Giesbrecht 1992a",
	author = "M. Giesbrecht",
	title = "Factoring in skew-polynomial rings",
	booktitle = LATIN92,
	editor = "I. Simon",
	publisher = SV,
	series = LNICS,
	volume = 583,
	year = "{\noopsort{1992a}}1992",
	pages = "191-203"}

@inproceedings{Giesbrecht:1992b,
	key = "Giesbrecht 1992b",
	author = "M. Giesbrecht",
	title = "Fast algorithms for matrix normal forms",
	booktitle = FOCS92,
	year = "{\noopsort{1992b}}1992",
	pages = "121-130"}

@article{vonzurGathen:1991c,
	key = "von zur Gathen 1991c",
	author = "Gathen, J. von zur",
	title = "Tests for permutation polynomials",
	journal = SIAMJC,
	volume = 20,
	year = "{\noopsort{1991c}}1991",
	pages = "591-602"}

@article{Seguin:1990,
	key = "S{\' e}guin 1990",
	author = "G. E. S{\' e}guin",
	title = "Low complexity normal bases for {$F_{2^{mn}}$}",
	journal = DAM,
	volume = 28,
	year = 1990,
	pages = "309-312"}

@article{Stong:1993,
	key = "Stong 1993",
	author = "R. Stong",
	title = "The average order of a matrix",
	journal = JCTA,
	volume = 64,
	year = 1993,
	pages = "337-343"}

@techreport{Bogestrand&Lund:1988,
	key = "B{\o o}gestrand and Lund 1988",
	author = "K. B{\o o}gestrand and C. Lund",
	title = "Computation in finite fields",
	institution = "Computer Science Dept., Aarhus Univ.",
	year = 1988,
	month = "March"}

@article{Fenn&Benaissa&Taylor:1993,
	key = "Fenn, Benaissa, and Taylor 1993",
	author = "S. T. J. Fenn and M. Benaissa and D. Taylor",
	title = "Improved algorithm for division over {$GF(2^m)$}",
	journal = ELETT,
	volume = 29,
	year = 1993,
	pages = "469-470"}

@article{Niederreiter&Gottfert:1995,
	key = "Niederreiter and {G\"ottfert} 1995",
	author = "H. Niederreiter and R. {G\"ottfert}",
	title = "On a new factorization algorithm for polynomials over finite fields",
	journal = MC,
	volume = 64,
	year = 1995,
	pages = "347-353"}

@incollection{Lempel&Seroussi:1993,
	key = "Lempel and Seroussi 1993",
	author = "A. Lempel and G. Seroussi",
	title = "Application of finite fields to memory interleaving",
	booktitle = AAECC10,
	series = LNICS,
	volume = 673,
	year = 1993,
	editor = "G. Cohen and T. Mora and O. Moreno",
	pages = "244-256",
	publisher = SV}

@article{Redinbo:1979,
	key = "Redinbo 1979",
	author = "G. R. Redinbo",
	title = "Finite field arithmetic on an array processor",
	journal = IEEE-TC,
	volume = "C-28",
	year = 1979,
	pages = "461-471"}

@article{Averbuch&Bshouty&Kaminski:1992,
	key = "Averbuch, Bshouty, and Kaminski 1992",
	author = "A. Averbuch and N. H. Bshouty and M. Kaminski",
	title = "A classification of algorithms for multiplying polynomials
of small degree over finite fields",
	journal = JA,
	volume = 13,
	year = 1992,
	pages = "577-588"}

@article{Kaminski&Bshouty:1989,
	key = "Kaminski and Bshouty 1989",
	author = "M. Kaminski and N. H. Bshouty",
	title = "Multiplicative complexity of polynomial
multiplication over finite fields",
	journal = JACM,
	volume = 36,
	year = 1989,
	pages = "150-170"}

@inproceedings{Kaminski&Bshouty:1987,
	key = "Kaminski and Bshouty 1987",
	author = "M. Kaminski and N. H. Bshouty",
	title = "Multiplicative complexity of polynomial
multiplication over finite fields",
	booktitle = FOCS87,
	publisher = ACM,
	year = 1987,
	pages = "138-140"}

@article{Bshouty&Kaminski:1990,
	key = "Bshouty and Kaminski 1990",
	author = "N. H. Bshouty and M. Kaminski",
	journal = SIAMJC,
	title = "Multiplication of polynomials over
finite fields",
	volume = 19,
	year = 1990,
	pages = "452-456"}

@article{Bshouty:1992,
	key = "Bshouty 1992",
	author = "N. H. Bshouty",
	title = "A lower bound for the multiplication of
polynomials modulo a polynomial",
	journal = IPL,
	volume = 41,
	year = 1992,
	pages = "321-326"}

@inproceedings{Kaltofen&Shoup:1995,
	key = "Kaltofen and Shoup 1995",
	author = "E. Kaltofen and V. Shoup",
	title = "Subquadratic-time factoring of polynomials over finite fields",
	year = 1995,
	booktitle = STOC95,
	publisher = ACM,
	pages = "398-406"}

@article{Eisenstein:1850,
	key = "Eisenstein 1850",
	author = "G. Eisenstein",
	title = "Lehrs{\"a}tze",
	journal = JFRAM,
	volume = 39,
	year = 1850,
	pages = "180-182",
	note = "Reprinted in {\it Werke,} Vol.~2, pp.~620--622"}

@article{Hensel:1888,
	key = "Hensel 1888",
	author = "K. Hensel",
	title = "Ueber die {D}arstellung der {Z}ahlen eines {G}attungsbereiches                  f{\"u}r einen beliebigen {P}rimdivisor",
	journal = JFRAM,
	volume = 103,
	year = 1888,
	pages = "203-207"}

@article{Lenstra&Schoof:1987,
	key = "H. W. Lenstra and Schoof 1987",
	author = "Lenstra, Jr., H. W. and R. J. Schoof",
	title = "Primitive normal bases for finite fields",
	journal = MC,
	volume = 48,
	year = 1987,
	pages = "217-231"}

@inproceedings{Luneburg:1985,
	key = "L{\"u}neburg 1985",
	author = "H. L{\"u}neburg",
	title = "On a little but useful algorithm",
	booktitle = "AAECC-3",
	editor = "J. Calmet",
	year = 1985,
	series = LNICS,
	volume = 229,
	pages = "296-301"}

@article{Chambers:1993,
	key = "Chambers 1993",
	author = "W. G. Chambers",
	title = "Solution of {Welch}-{Berlekamp} key equation by
		 {Euclidean} algorithm",
	journal = ELETT,
	volume = 29,
	year = 1993,
	pages = "1031"}

@article{Dornsetter:1987,
	key = "Dornsetter 1987",
	author = "J. L. Dornsetter",
	title = "On the equivalence between {Berlekamp's}
		 and {Euclid's} algorithms",
	journal = IEEE-IT,
	volume = "IT-33",
	year = 1987,
	pages = "428-431"}

@book{Effinger&Hayes:1991,
  	key = "Effinger and Hayes 1991",
  	author = "G. W. Effinger and D. R. Hayes",
  	title = "Additive Number Theory of Polynomials over a Finite Field",
  	publisher = OUP,
  	year = 1991}

@book{Davenport&Siret&Tournier:1988,
  	key = "J. Davenport, Siret, and Tournier 1988",
  	author = "J. H. Davenport and Y. Siret and E. Tournier",
  	title = "Computer Algebra",
  	publisher = AP,
  	year = 1988}

@article{Thomas&Keller&Larsen:1986,
	key = "Thomas, Keller, and Larsen 1986",
	author = "J. J. Thomas and J. M. Keller and G. N. Larsen",
	title = "The calculation of multiplicative inverses over {$GF(P)$}
		 efficiently where {$P$} is a {M}ersenne prime",
	journal = IEEE-TC,
	volume = "C-35",
	year = 1986,
	pages = "478-482"}

@article{Akbik:1992,
	key = "Akbik 1992",
	author = "S. Akbik",
	title = "Normal generators of finite fields",
	journal = JNT,
	volume = "41",
	year = 1992,
	pages = "146-149"}

@article{Guerrier:1968,
	key = "Guerrier 1968",
	author = "W. J. Guerrier",
	title = "The factorization of the cyclotomic polynomials mod {$p$}",
	journal = AMM,
	volume = 75,
	year = 1968,
	pages = "46"}

@article{Kornblum:1919,
	key = "Kornblum 1919",
	author = "H. Kornblum",
	title = "{\"Uber} die {P}rimfunktionen in einer arithmetischen
		{P}rogression",
	journal = MZ,
	volume = 5,
	year = 1919,
	pages = "100-111"}

@article{Mignotte:1976b,
	key = "Mignotte 1976b",
	author = "M. Mignotte",
	title = "Algorithmes relatifs {\`a} la d{\'e}composition 
		 des polyn{\^omes}",
	journal = TCS,
	year = "{\noopsort{1976b}1976}",
	volume = 1,
	pages = "227-235"}

@article{Dirichlet:1832,
	key = "Dirichlet 1832",
	author = "P. G. L. Dirichlet",
	title = "{D\'emonstration} d'une {propri\'et\'e} analogue {\`a} 
		 la loi de r{\'e}ciprocit{\'e} qui existe entre deux 
		 nombres premiers quelconques",
	journal = JFRAM,
	year = 1832,
	volume = 9,
	pages = "379-389",
	note = "Reprinted in {\it Werke}, Vol.~1, pp.~173--188"}

@book{Kramer:1981,
  	key = "Kramer 1981",
  	author = "E. E. Kramer",
  	title = "The Nature and Growth of Modern Mathematics",
  	publisher = PUP,
  	year = 1981}

@incollection{Gao&von.zur.Gathen&Panario:1995,
	key = "Gao, von zur Gathen, and Panario 1995",
	author = "S. Gao and Gathen, J. von zur and D. Panario",
	title = "Gauss periods and fast exponentiation in finite fields",
	booktitle = LATIN95,
	series = LNICS,
	volume = 911,
	year = 1995,
	editor = "R. Baeza-Yates and E. Goles and P. V. Poblete",
	pages = "311-322",
	publisher = SV}

@incollection{Knopfmacher&Knopfmacher&Warlimont:1994,
	key = "Knopfmacher, Knopfmacher, and Warlimont 1994",
	author = "A. Knopfmacher and J. Knopfmacher and R. Warlimont",
	title = "Lengths of factorizations for polynomials over a finite field",
	booktitle = "Finite Fields:  Theory, Applications, and Algorithms",
	series = "Contemporary Mathematics",
	volume = 168,
	publisher = AMS,
	year = 1994,
	editor = "G. L. Mullen and P. J.-S. Shiue",
	pages = "185-205"}

@incollection{Elia:1993,
	key = "Elia 1993",
	author = "M. Elia",
	title = "Some comments on the computation of $n$'th roots in
{$\Zee_N^*$}",
	booktitle = "Sequences II:  Methods in Communication, Security, and
Computer Science",
	editor = "R. Capocelli and de Santis, A. and Vaccaro, U.",
	publisher = SV,
	year = 1993,
	pages = "379-391"}