✦ LIBER ✦

Fast Construction of Irreducible Polynomials over Finite Fields

✍ Scribed by Victor Shoup

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 657 KB
Volume: 17
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dickson Polynomials and Irreducible Poly

Dickson Polynomials and Irreducible Polynomials Over Finite Fields

✍ S.H. Gao; G.L. Mullen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Periods of Maps on Irreducible Polynomia

Periods of Maps on Irreducible Polynomials over Finite Fields

✍ Patrick Morton 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Polynomial Distribution and Sequences of

Polynomial Distribution and Sequences of Irreducible Polynomials over Finite Fields

✍ Wun-Seng Chou; Stephen D Cohen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Let k=GF(q) be the finite field of order q. Let f 1 (x), f 2 (x) # k[x] be monic relatively prime polynomials satisfying n=deg f 1 >deg f 2 0 and f 1 (x)Âf 2 (x){ g 1 (x p )Âg 2 (x p ) for any g 1 (x), g 2 (x) # k[x]. Write Q(x)= f 1 (x)+tf 2 (x) and let K be the splitting field of Q(x) over k(t). L

Counting irreducible factors of polynomi

Counting irreducible factors of polynomials over a finite field

✍ Arnold Knopfmacher; John Knopfmacher 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Counting irreducible factors of polynomials over a finite field, Discrete Mathematics, 112 (1993) 103-l 18. Let F,[X] denote a polynomial ring in an indeterminate X over a finite field IF,. Exact formulae are derived for (i) the number of polynomials of degree n in F,[X] with a specified number of i

Exceptional Polynomials over Finite Fiel

Exceptional Polynomials over Finite Fields

✍ S.D. Cohen; R.W. Matthews 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 641 KB

A recently discovered family of indecomposable polynomials of nonprime power degree over $\mathbb{F}_{2}$ (which include a class of exceptional polynomials) is set against the background of the classical families and their monodromy groups are obtained without recourse to the classification of fin

Factoring Polynomials over Special Finit

Factoring Polynomials over Special Finite Fields

✍ Eric Bach; Joachim von zur Gathen; Hendrik W. Lenstra Jr. 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas