Two low differentially uniform power permutations over odd characteristic finite fields: APN and differentially $4$-uniform functions
Haode Yan, Sihem Mesnager, and Xiantong Tan

TL;DR
This paper investigates specific power permutations over finite fields of odd characteristic, determining their differential spectrum and uniformity, and identifies conditions under which they are APN or differentially 4-uniform.
Contribution
It solves a long-standing open problem by precisely characterizing the differential spectrum of certain power functions over finite fields where p^n ≡ 3 mod 4.
Findings
F is APN when p^n=11
F is differentially 4-uniform for other cases
Provides explicit evaluation of exponential sums and solution counts
Abstract
Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials constitutes an active research area in which advances are being made constantly. In particular, constructing infinite classes of permutation polynomials over finite fields with good differential properties (namely, low) remains an exciting problem despite much research in this direction for many years. This article exhibits low differentially uniform power permutations over finite fields of odd characteristic. Specifically, its objective is twofold concerning the power functions defined over the finite field of order , where is an odd prime, and is a positive integer. The first is to complement some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Islamic Finance and Communication · Cryptography and Residue Arithmetic
