Permutation binomials over finite fields
Masuda, Ariane M. · Zieve, Michael E.
Original · EN
We prove that if xᵐ + c*xⁿ permutes the prime field GF(p), where m>n>0 and c is in GF(p)*, then gcd(m-n,p-1) > sqrtp - 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ᵐ + c*xⁿ if and only if gcd(m,n,q-1) = 1.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.