Permutation binomials over finite fields

Details Permutation binomials over finite fields Permutation binomials over finite fields

2007-07-07

arxiv.org/abs/0707.1108v3

Mathematics

Number Theory

12 pages; various minor changes

Scientific paper

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and
c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if
q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q),
then there exist permutation binomials over GF(q) of the form x^m + c*x^n if
and only if gcd(m,n,q-1) = 1.

Affiliated with

Also associated with

No associations

Rating

Permutation binomials over finite fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Permutation binomials over finite fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutation binomials over finite fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-702396