Dickson polynomials and irreducible polynomials over finite fields

Shuhong Gao, Gary Lee Mullen

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

In this paper we establish necessary and sufficient conditions for Dn(x, a) + b to be irreducible over Fq, where a, b ∈ Fq, the finite field Fq of order q, and Dn(x, a) is the Dickson polynomial of degree n with parameter a ∈ Fq. As a consequence we construct several families of irreducible polynomials of arbitrarily high degrees. In addition we show that the following conjecture of Chowla and Zassenhaus from 1968 is false for Dickson polynomials: if f(x) has integral coefficients and has degree at least two, and p is a sufficiently large prime for which f(x) does not permute Fp, then there is an element c ∈ Fp so that f(x) + c is irreducible over Fp. We also show that the minimal polynomials of elements which generate one type of optimal normal bases can be derived from Dickson polynomials.

Original languageEnglish (US)
Pages (from-to)118-132
Number of pages15
JournalJournal of Number Theory
Volume49
Issue number1
DOIs
StatePublished - Jan 1 1994

Fingerprint

Dickson Polynomials
Irreducible polynomial
Galois field
Normal Basis
Minimal polynomial
Necessary Conditions
Sufficient Conditions
Coefficient

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory

Cite this

@article{b490e469cb06477e93a258ae57fbd3cf,
title = "Dickson polynomials and irreducible polynomials over finite fields",
abstract = "In this paper we establish necessary and sufficient conditions for Dn(x, a) + b to be irreducible over Fq, where a, b ∈ Fq, the finite field Fq of order q, and Dn(x, a) is the Dickson polynomial of degree n with parameter a ∈ Fq. As a consequence we construct several families of irreducible polynomials of arbitrarily high degrees. In addition we show that the following conjecture of Chowla and Zassenhaus from 1968 is false for Dickson polynomials: if f(x) has integral coefficients and has degree at least two, and p is a sufficiently large prime for which f(x) does not permute Fp, then there is an element c ∈ Fp so that f(x) + c is irreducible over Fp. We also show that the minimal polynomials of elements which generate one type of optimal normal bases can be derived from Dickson polynomials.",
author = "Shuhong Gao and Mullen, {Gary Lee}",
year = "1994",
month = "1",
day = "1",
doi = "10.1006/jnth.1994.1086",
language = "English (US)",
volume = "49",
pages = "118--132",
journal = "Journal of Number Theory",
issn = "0022-314X",
publisher = "Academic Press Inc.",
number = "1",

}

Dickson polynomials and irreducible polynomials over finite fields. / Gao, Shuhong; Mullen, Gary Lee.

In: Journal of Number Theory, Vol. 49, No. 1, 01.01.1994, p. 118-132.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Dickson polynomials and irreducible polynomials over finite fields

AU - Gao, Shuhong

AU - Mullen, Gary Lee

PY - 1994/1/1

Y1 - 1994/1/1

N2 - In this paper we establish necessary and sufficient conditions for Dn(x, a) + b to be irreducible over Fq, where a, b ∈ Fq, the finite field Fq of order q, and Dn(x, a) is the Dickson polynomial of degree n with parameter a ∈ Fq. As a consequence we construct several families of irreducible polynomials of arbitrarily high degrees. In addition we show that the following conjecture of Chowla and Zassenhaus from 1968 is false for Dickson polynomials: if f(x) has integral coefficients and has degree at least two, and p is a sufficiently large prime for which f(x) does not permute Fp, then there is an element c ∈ Fp so that f(x) + c is irreducible over Fp. We also show that the minimal polynomials of elements which generate one type of optimal normal bases can be derived from Dickson polynomials.

AB - In this paper we establish necessary and sufficient conditions for Dn(x, a) + b to be irreducible over Fq, where a, b ∈ Fq, the finite field Fq of order q, and Dn(x, a) is the Dickson polynomial of degree n with parameter a ∈ Fq. As a consequence we construct several families of irreducible polynomials of arbitrarily high degrees. In addition we show that the following conjecture of Chowla and Zassenhaus from 1968 is false for Dickson polynomials: if f(x) has integral coefficients and has degree at least two, and p is a sufficiently large prime for which f(x) does not permute Fp, then there is an element c ∈ Fp so that f(x) + c is irreducible over Fp. We also show that the minimal polynomials of elements which generate one type of optimal normal bases can be derived from Dickson polynomials.

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

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

U2 - 10.1006/jnth.1994.1086

DO - 10.1006/jnth.1994.1086

M3 - Article

AN - SCOPUS:0011289576

VL - 49

SP - 118

EP - 132

JO - Journal of Number Theory

JF - Journal of Number Theory

SN - 0022-314X

IS - 1

ER -