On Two Conjectures about Permutation Trinomials over \mathbbF_3^2k

2016/10/14 by Nian Li, Li, Nian
Computer Science · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Residue Arithmetic #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1610.04441

openalex publication_date 2016/10/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Permutation polynomials with few terms attracts researchers' interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree polynomial and a seventh-degree polynomial over the finite field \mathbbF_3^2k, two conjectures on permutation trinomials over \mathbbF_3^2k proposed recently by Li, Qu, Li and Fu are settled, where k is a positive integer.

Citations

• New Classes of Permutation Binomials and Permutation Trinomials over Finite Fields
• Permutation polynomials and group permutation polynomials

Related

• A conjecture on permutation trinomials over finite fields of characteristic two
• Permutation polynomials, fractional polynomials, and algebraic curves
• A note on permutation polynomials over finite fields
• More new classes of permutation trinomials over \mathbbF_2ⁿ
• Several Classes of Permutation Trinomials over \mathbb F_5ⁿ From Niho Exponents