On k-PN Functions over Finite Fields

2013/12/24 by Marco Pizzato, Pizzato, Marco
Computer Science · Mathematics · #11T06 #Coding theory and cryptography #Cryptography and Data Security #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT) #math.NT #msc:11T06

paper · pdf · doi:10.48550/arxiv.1312.6839

14 pages

arxiv created 2013/12/24 · openalex publication_date 2013/12/24 · arxiv updated 2013/12/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Starting from PN functions, we introduce the concept of k-PN functions and classify k-PN monomials over finite fields of order p, p² and p⁴ for small values of k.

Citations

• Theorie des Fonctions Numeriques Simplement Periodiques

Related

• Classification of Planar Monomials Over Finite Fields of Small Order
• A class of APcN power functions over finite fields of even characteristic
• On the Conjecture on APN Functions
• Several classes of PcN power functions over finite fields
• A lower bound on the number of inequivalent APN functions