Search arXivSearch

arXiv · 2609.15445

Differential-linear profiles over finite fields of arbitrary characteristic

Abstract

The (binary) differential-linear connectivity table (DLCT) measures the dependence between an input difference and a linear mask applied to the corresponding output difference. For vectorial Boolean functions, each DLCT entry is one half of an additive autocorrelation value. We extend this relation to functions over finite fields of arbitrary prime characteristic by introducing a level-resolved p-ary differential-linear profile. Its entries are the centered numbers of inputs for which a derivative component has each prescribed trace value in $\mathbb{F}_p$. The discrete Fourier transform of this profile is the family of additive autocorrelations obtained by multiplying the output mask by the nonzero elements of $\mathbb{F}_p$; when p=2, the usual binary identity is recovered. For a fixed input difference, we show that the profiles over all nonzero output masks determine the corresponding DDT row exactly, and we give an explicit inversion formula. We establish a second-moment identity: the total profile energy in one derivative direction is a constant multiple of the squared Euclidean distance between that DDT row and the balanced row. Thus this energy is determined by the full row differential spectrum, not by differential uniformity alone. It follows that all profiles in a direction vanish exactly when the derivative is balanced; for square maps in odd characteristic, this gives a characterization of planarity. As concrete odd-characteristic examples, we determine the complete profile of the monomial $x^{p^k+1}$ and derive an exact Kloosterman-sum formula for the inverse monomial. Finally, we determine the behavior of the profiles under equivalence. EA-equivalence reindexes the input and output masks and translates the trace level, whereas a general CCZ equivalence may mix several derivative directions. Nevertheless, for square maps the global nontrivial profile energy is CCZ-invariant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kirpa Garg, Constanza Riera, Pantelimon Stănică. 2026-09-14. Differential-linear profiles over finite fields of arbitrary characteristic. https://arxiv.org/abs/2609.15445

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT