Permutation binomials over finite fields

From MaRDI portal
Publication:5322889




Abstract: 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.




Cited in
(39)






This page was built for publication: Permutation binomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322889)