Abstract

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper, we investigate the trinomial f(x) = x (p−1)q+1 + x p q − x q+(p−1) over the finite field $\mathbb {F}_{q^{2}}$ , where p is an odd prime and q = p k with k being a positive integer. It is shown that when p = 3 or 5, f(x) is a permutation trinomial of $\mathbb {F}_{q^{2}}$ if and only if k is even. This property is also true for a more general class of polynomials g(x) = x (q+1)l+(p−1)q+1 + x (q+1)l + p q − x (q+1)l + q+(p−1), where l is a nonnegative integer and $\gcd (2l+p,q-1)=1$ . Moreover, we also show that for p = 5 the permutation trinomials f(x) proposed here are new in the sense that they are not multiplicative equivalent to previously known ones of similar form.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.