On APN Exponents and the Differential and Boomerang Properties of Binomials in Characteristic 3

• URL: http://arxiv.org/abs/2605.23224v1
• Date: Fri, 22 May 2026 04:33:54 GMT
• Title: On APN Exponents and the Differential and Boomerang Properties of Binomials in Characteristic 3
• Abstract summary: We show that binomials of the form $F_r(x) = xr (1 + (x))$ over $mathbbF_pn$ exhibit very low boomerang uniformity.<n>We identify and rigorously prove two classes of binomials $F_r$ that are locally-PN and possess the minimum possible boomerang uniformity of $0$.
• Score: 0.27998963147546135
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent studies on binomials of the form $F_r(x) = x^r(1 + χ(x))$ over $\mathbb{F}_{p^n}$ have shown that these functions can exhibit very low boomerang uniformity. In this paper, we focus on the specific behavior of such binomials in characteristic $3$, where instances of extremely low boomerang uniformity-namely $0$ or $1$-seem to arise more frequently than in other characteristics. First, we provide a systematic analysis of Almost Perfect Nonlinear (APN) power functions in characteristic $3$. We present an explicit parametrization of APN exponents arising from the construction of Zha and Wang and demonstrate through numerical results for $n \le 13$ that this generalized framework accounts for several previously known and sporadic APN instances. Building on this classification, we identify and rigorously prove two classes of binomials $F_r$ that are locally-PN and possess the minimum possible boomerang uniformity of $0$. These classes involve exponents derived from the aforementioned APN construction and the differentially 4-uniform exponent $r = 2 \cdot 3^{\frac{n-1}{2}} + 1$. Furthermore, we analyze the binomial $F_r$ with $r = 3^n - 3$, proving that it is locally-APN with boomerang uniformity $1$ when $n\ge 5$ is odd, and completely determine its boomerang spectrum through the evaluation of character sums. Our results clarify and extend existing studies on the cryptographic properties of binomials, providing a systematic characterization of several classes of binomials with very low boomerang uniformity in characteristic $3$.

Related papers

• On APN Functions with Boomerang Uniformity One over $\mathbb F_{3^n}$: Differential and Boomerang Spectra and CCZ-Inequivalence [0.27998963147546135]
  We prove that every $widetilde G_c$ is APN and has boomerang uniformity either one or two.<n>We also prove that CCZ equivalence between sign-switches of DO PN functions forces EA equivalence between the original PN functions.
  arXiv  Detail & Related papers  (2026-09-08T16:19:46Z)
• Rényi exponent landscape of multipartite entanglement in free-fermion systems [51.56484100374058]
  We show that the Rényi tripartite information $I_3() exhibits a qualitatively $exclusion-dependent scaling at small Fermi momentum.<n>A direct consequence is a replica obstruction: $I_m(n)/I_m(1) sim zm-1 to 0$ for all integer $n geq 2$, so the leading von Neumann signal cannot be reconstructed from integer Rényi data.
  arXiv  Detail & Related papers  (2026-03-09T22:27:00Z)
• On Differential and Boomerang Properties of a Class of Binomials over Finite Fields of Odd Characteristic [1.104960878651584]
  We show that $F_r,pm1$ is locally-PN with boomerang uniformity $0$ when $pn equiv 3 pmod8$.<n>We also provide complete classifications of the differential and boomerang spectra of $F_r,pm1$.
  arXiv  Detail & Related papers  (2025-06-13T06:23:32Z)
• Learning single-index models via harmonic decomposition [21.065469907392643]
  We study the problem of learning single-index models, where the label $y in mathbbR$ depends on the input $boldsymbolx in mathbbRd$ only through an unknown one-dimensional projection.<n>We introduce two families of estimators -- based on tensor unfolding and online SGD -- that respectively achieve either optimal sample complexity or optimal runtime.
  arXiv  Detail & Related papers  (2025-06-11T15:59:53Z)
• The Differential and Boomerang Properties of a Class of Binomials [28.489574654566677]
  We study the differential and boomerang properties of the function $F_2,u(x)=x2big (1+ueta(x)big)$ over $mathbbF_q$. We disproving a conjecture proposed in citebudaghyan2024arithmetization which states that there exist infinitely many $q$ and $u$ such that $F_2,u$ is an APN function.
  arXiv  Detail & Related papers  (2024-09-21T23:33:00Z)
• An in-depth study of the power function $x^{q+2}$ over the finite field $\mathbb{F}_{q^2}$: the differential, boomerang, and Walsh spectra, with an application to coding theory [28.489574654566677]
  We examine the finite field $mathbbF_q2$, which consists of $q2$ elements.<n>We first present an alternative method to determine the differential spectrum of the power function $f(x) = xq+2$ on $mathbbF_q2$, incorporating several key simplifications.
  arXiv  Detail & Related papers  (2024-07-08T14:01:06Z)
• Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit [75.4661041626338]
  We study the problem of gradient descent learning of a single-index target function $f_*(boldsymbolx) = textstylesigma_*left(langleboldsymbolx,boldsymbolthetarangleright)$<n>We prove that a two-layer neural network optimized by an SGD-based algorithm learns $f_*$ with a complexity that is not governed by information exponents.
  arXiv  Detail & Related papers  (2024-06-03T17:56:58Z)
• Learning Hierarchical Polynomials with Three-Layer Neural Networks [56.71223169861528]
  We study the problem of learning hierarchical functions over the standard Gaussian distribution with three-layer neural networks. For a large subclass of degree $k$s $p$, a three-layer neural network trained via layerwise gradientp descent on the square loss learns the target $h$ up to vanishing test error. This work demonstrates the ability of three-layer neural networks to learn complex features and as a result, learn a broad class of hierarchical functions.
  arXiv  Detail & Related papers  (2023-11-23T02:19:32Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Statistical Learning under Heterogeneous Distribution Shift [71.8393170225794]
  Ground-truth predictor is additive $mathbbE[mathbfz mid mathbfx,mathbfy] = f_star(mathbfx) +g_star(mathbfy)$.
  arXiv  Detail & Related papers  (2023-02-27T16:34:21Z)
• Shallow neural network representation of polynomials [91.3755431537592]
  We show that $d$-variables of degreeR$ can be represented on $[0,1]d$ as shallow neural networks of width $d+1+sum_r=2Rbinomr+d-1d-1d-1[binomr+d-1d-1d-1[binomr+d-1d-1d-1[binomr+d-1d-1d-1d-1[binomr+d-1d-1d-1d-1
  arXiv  Detail & Related papers  (2022-08-17T08:14:52Z)
• Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
  We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits. We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
  arXiv  Detail & Related papers  (2021-04-26T15:03:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.