On permutation binomials over finite fields

Abstract: Let

m a t h b b F_{q}

be the finite field of characteristic

p

containing

q = p^{r}

elements and

f (x) = a x^{n} + x^{m}

a binomial with coefficients in this field. If some conditions on the gcd of

n - m

an

q - 1

are satisfied then this polynomial does not permute the elements of the field. We prove in particular that if

f (x) = a x^{n} + x^{m}

permutes

m a t h b b F_{p}

, where

n > m > 0

and

a i n {m a t h b b F_{p}}^{*}

, then

p - 1 l e q (d - 1) d

, where

d = g c d (n - m, p - 1)

, and that this bound of

p

in term of

d

only, is sharp. We show as well how to obtain in certain cases a permutation binomial over a subfield of

m a t h b b F_{q}

from a permutation binomial over

m a t h b b F_{q}

.

Recommendations

Cites work

Cited in

(22)

This page was built for publication: On permutation binomials over finite fields