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

• URL: http://arxiv.org/abs/2407.07710v3
• Date: Tue, 14 Jan 2025 14:09:20 GMT
• Title: 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
• Authors: Sihem Mesnager, Huawei Wu,
• Abstract summary: We examine the finite field $mathbbF_q2$, which consists of $q2$ elements. 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.
• Score: 28.489574654566677
• License:
• Abstract: Let $q = p^m$, where $p$ is an odd prime number and $m$ is a positive integer. In this paper, we examine the finite field $\mathbb{F}_{q^2}$, which consists of $q^2$ elements. We first present an alternative method to determine the differential spectrum of the power function $f(x) = x^{q+2}$ on $\mathbb{F}_{q^2}$, incorporating several key simplifications. This methodology provides a new proof of the results established by Man, Xia, Li, and Helleseth in Finite Fields and Their Applications 84 (2022), 102100, which not only completely determine the differential spectrum of $f$ but also facilitate the analysis of its boomerang uniformity. Specifically, we determine the boomerang uniformity of $f$ for the cases where $q \equiv 1$ or $3$ (mod $6$), with the exception of the scenario where $p = 5$ and $m$ is even. Furthermore, for $p = 3$, we investigate the value distribution of the Walsh spectrum of $f$, demonstrating that it takes on only four distinct values. Using this result, we derive the weight distribution of a ternary cyclic code with four Hamming weights. The article integrates refined mathematical techniques from algebraic number theory and the theory of finite fields, employing several ingredients, such as exponential sums, to explore the cryptographic analysis of functions over finite fields. They can be used to explore the differential/boomerang uniformity across a wider range of functions.

Related papers

• 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. 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)
• 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)$ 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)
• $φ^n$ trajectory bootstrap [1.8855270809505869]
  We show that the non-integer $n$ results for $langlephinrangle$ or $langle(iphi)nrangle$ are consistent with those from the wave function approach. In the $mathcalPT$ invariant case, the existence of $langle(iphi)nrangle$ with non-integer $n$ allows us to bootstrap the non-Hermitian theories with non-integer powers.
  arXiv  Detail & Related papers  (2024-02-08T16:09:06Z)
• 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)
• Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
  We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk. The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra. As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
  arXiv  Detail & Related papers  (2022-08-12T15:05:07Z)
• Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
  We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
  arXiv  Detail & Related papers  (2022-06-17T17:55:43Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem [4.549831511476248]
  We show that for any total Boolean function $f$, $bullet quad mathrmdeg(f) = O(widetildemathrmdeg(f)2)$: The degree of $f$ is at mosttrivial quadratic in the approximate degree of $f$. We show that if $f$ is a non monotone graph property of an $n$-vertex graph specified by its adjacency matrix, then $mathrmQ(f)=Omega(n)$, which is also optimal.
  arXiv  Detail & Related papers  (2020-10-23T19:21: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.