Complete permutation polynomials have many applications in mathematics and cryptography. In this paper, we study the complete permutation property of polynomial xh(xq−1)q+1 over Fq2, where h(x)=h1(x+xq)+h2(x+xq)xk. Based on the trace functions and Dickson polynomials, we present several new constructions of such complete permutations by choosing suitable h1(x), h2(x), and k.
Li et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: