On Differential and Boomerang Properties of a Class of Binomials over Finite Fields of Odd Characteristic
- URL: http://arxiv.org/abs/2506.11486v1
- Date: Fri, 13 Jun 2025 06:23:32 GMT
- Title: On Differential and Boomerang Properties of a Class of Binomials over Finite Fields of Odd Characteristic
- Authors: Namhun Koo, Soonhak Kwon,
- Abstract summary: 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$.
- Score: 1.104960878651584
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper, we investigate the differential and boomerang properties of a class of binomial $F_{r,u}(x) = x^r(1 + u\chi(x))$ over the finite field $\mathbb{F}_{p^n}$, where $r = \frac{p^n+1}{4}$, $p^n \equiv 3 \pmod{4}$, and $\chi(x) = x^{\frac{p^n -1}{2}}$ is the quadratic character in $\mathbb{F}_{p^n}$. We show that $F_{r,\pm1}$ is locally-PN with boomerang uniformity $0$ when $p^n \equiv 3 \pmod{8}$. To the best of our knowledge, the second known non-PN function class with boomerang uniformity $0$, and the first such example over odd characteristic fields with $p > 3$. Moreover, we show that $F_{r,\pm1}$ is locally-APN with boomerang uniformity at most $2$ when $p^n \equiv 7 \pmod{8}$. We also provide complete classifications of the differential and boomerang spectra of $F_{r,\pm1}$. Furthermore, we thoroughly investigate the differential uniformity of $F_{r,u}$ for $u\in \mathbb{F}_{p^n}^* \setminus \{\pm1\}$.
Related papers
- Weight distribution of a class of $p$-ary codes [0.0]
We prove all possible weights of codewords in $mathcalC_alpha,beta,beta$, demonstrating that it has at most $p+1$ distinct nonzero weights.<n>We also prove that the dual code $mathcalC_alpha,beta$ is optimal with respect to the sphere packing bound.
arXiv Detail & Related papers (2025-03-24T20:53:04Z) - A note on the differential spectrum of a class of locally APN functions [1.8109081066789852]
We first give some properties of the differential spectrum of any cryptographic function.<n>By solving some systems of equations over finite fields, we express the differential spectrum of $f_pm1$ in terms of the quadratic character sums.
arXiv Detail & Related papers (2025-01-08T02:17:06Z) - 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) - On the second-order zero differential properties of several classes of power functions over finite fields [4.100056500795057]
Feistel Boomerang Connectivity Table (FBCT) is an important cryptanalytic technique on analysing the resistance of the Feistel network-based ciphers to power attacks such as differential and boomerang attacks.
In this paper, by computing the number of solutions of specific equations over finite fields, we determine explicitly the second-order zero differential spectra of power functions $x2m+3$ and $x2m+5$.
The computation of these entries and the cardinalities in each table aimed to facilitate the analysis of differential and boomerang cryptanalysis of S-boxes.
arXiv Detail & Related papers (2024-09-18T04:27:03Z) - Further Investigation on Differential Properties of the Generalized Ness-Helleseth Function [13.67029767623542]
The function defined by $f_u(x)=uxd_1+xd_2$ is called the generalized Ness-Helleseth function over $mathbbF_pn$.
For each $u$ satisfying $chi(u+1) = chi(u-1)$, the differential spectrum of $f_u(x)$ is investigated.
arXiv Detail & Related papers (2024-08-30T13:18:23Z) - Provably learning a multi-head attention layer [55.2904547651831]
Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models.
In this work, we initiate the study of provably learning a multi-head attention layer from random examples.
We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
arXiv Detail & Related papers (2024-02-06T15:39:09Z) - Dimension-free discretizations of the uniform norm by small product sets [45.85600902330814]
A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity.<n>We show that dimension-free discretizations are possible with sampling sets whose cardinality is independent of $deg(f)$ and is instead governed by the maximum individual degree of $f$.
arXiv Detail & Related papers (2023-10-11T22:46:09Z) - 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) - The Approximate Degree of DNF and CNF Formulas [95.94432031144716]
For every $delta>0,$ we construct CNF and formulas of size with approximate degree $Omega(n1-delta),$ essentially matching the trivial upper bound of $n.
We show that for every $delta>0$, these models require $Omega(n1-delta)$, $Omega(n/4kk2)1-delta$, and $Omega(n/4kk2)1-delta$, respectively.
arXiv Detail & Related papers (2022-09-04T10:01:39Z) - Random matrices in service of ML footprint: ternary random features with
no performance loss [55.30329197651178]
We show that the eigenspectrum of $bf K$ is independent of the distribution of the i.i.d. entries of $bf w$.
We propose a novel random technique, called Ternary Random Feature (TRF)
The computation of the proposed random features requires no multiplication and a factor of $b$ less bits for storage compared to classical random features.
arXiv Detail & Related papers (2021-10-05T09:33:49Z) - 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) - A General Derivative Identity for the Conditional Mean Estimator in
Gaussian Noise and Some Applications [128.4391178665731]
Several identities in the literature connect $E[bf X|bf Y=bf y]$ to other quantities such as the conditional variance, score functions, and higher-order conditional moments.
The objective of this paper is to provide a unifying view of these identities.
arXiv Detail & Related papers (2021-04-05T12:48:28Z)
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.