Complete permutation polynomials induced from complete permutations of subfields

2013/12/19 by Baofeng Wu, Wu, Baofeng, Dongdai Lin +1
Computer Science · Engineering · #Antenna Design and Analysis #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.1312.5502

openalex publication_date 2013/12/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to construct complete permutations of certain extension fields with these techniques. The results generalize some recent work of several authors.

Citations

• Permutation polynomials induced from permutations of subfields, and some\n complete sets of mutually orthogonal latin squares

Related

• On constructing complete permutation polynomials over finite fields of even characteristic
• Specific permutation polynomials over finite fields
• A note on two classes of permutation polynomials over finite fields
• Permutation polynomials induced from permutations of subfields, and some\n complete sets of mutually orthogonal latin squares
• Complete permutation polynomials over finite fields of odd characteristic