Skip to content
Preprint

Explicit permutations of $(\mathbb{Z}/4\mathbb{Z})^m$ with uniformly bounded differential uniformity

Nov 2026 · 0 citations · 8 references
Mathematics Computer Science

Abstract

Symmetric primitives over Galois rings need nonlinear components whose differentials with respect to ring addition are controlled. Let $R=\mathrm{GR}(4,m)$ and $q=2^m$, so that $(R,+)\cong(\mathbb{Z}/4\mathbb{Z})^m$ has order $N=q^2$. For every $m\ge1$ we construct an explicit permutation $G_c$ of $R$ all of whose differentials with a nonzero input difference have probability at most $36/N$, whereas every permutation polynomial of $R$ has such a differential of probability at least $2/\sqrt{N}$ (Ronjom--Sandrib). The bound holds for the fixed permutation itself, not on average over keys. Equivalently, $\Delta(G_c)\le36$ against $\Delta\ge2\sqrt{N}$ for permutation polynomials; since every permutation has $\Delta\ge2$, the least differential uniformity of a permutation of $(\mathbb{Z}/4\mathbb{Z})^m$ lies between $2$ and $36$ for every $m$. In Teichmuller digits $(a,b)\in\mathbb{F}_q^2$ and for $c\in\mathbb{F}_q$ of absolute trace $1$, $G_c(a,b)=(L,(L^2+L+c)a)$ with $L=(a^2+a+c)b$. The map is $F_c\circ J\circ F_c$, where $F_c(a,b)=(a,(a^2+a+c)b)$ is induced by a polynomial over $R$ and $J$ exchanges the digits: a single digit exchange between two polynomial layers yields a bound independent of $m$. The proof reduces the difference equations, in each of three types of directions, to one-variable polynomials whose degrees do not depend on $m$. For general maps $F\circ J\circ F$ with $F(a,b)=(p(a),h(a)+d(a)b)$, where $p,d,h$ have degrees bounded independently of $m$, $p'\ne0$ and $d$ has no zeros, a Jacobian identity in characteristic $2$ bounds the differentials with nonzero low input and output differences independently of $m$; the remaining directions need a separate argument, which we give for an explicit family ($\Delta\le440$, resp. $510$, for odd $m$).

View source

Similar papers

Preprint Nov 2026

Extremal permutations of $\mathbb{Z}_n$ with many good slopes and applications to quantum Latin squares

For $n\ge2$, a good slope of a permutation $f$ of $\mathbb{Z}_n=\mathbb{Z}/n\mathbb{Z}$ is an element $m\in\mathbb{Z}_n$ for which $x\mapsto f(x)+mx$ is a permutation. We prove the sharp upper bound $\varphi(n)$ on the number of good slopes, where $\varphi$ is Euler's totient function. We classify and count the equalit...

D. K. Bhunia · 0 citations
Preprint Nov 2026

A complete classification of permutation binomials of the form $X^r(X^{2(q-1)}+a)$ over finite fields

Let $q$ be a prime power. We determine, for all positive integers $e$ and $r$, the coefficients $a\in\mathbb{F}_{q^e}$ for which $X^r(X^{2(q-1)}+a)$ permutes $\mathbb{F}_{q^e}$. For odd $q$ and $a\ne0$ there are no such permutations when $e\geqslant4$ is even. Over $\mathbb{F}_{q^2}$, with $r$ unrestricted, the permuta...

Zhi-Chao Tang, Xiang Fan · 0 citations
Preprint Oct 2026

The rank of $\mathbb{Z}_{2^s}$-linear Hadamard codes

The canonical $\mathbb{Z}_{2^s}$-linear Hadamard codes are the Gray images of the $\mathbb{Z}_{2^s}$-additive codes. Their rank, the dimension of the binary linear span, was known in closed form only for $s\le 3$, and for $s \ge 4$ only through computer computations for small lengths. We give a method that computes the...

Xuan Wang, Min-Jia Shi · 0 citations
Preprint Sep 2026

On Boston's Unramified Conjecture for $\mathrm{GL}_2$ and McLeman's $(3,3)$-Conjecture

Let $p$ be an odd prime and let $A$ be a complete Noetherian commutative local ring with finite residue field of characteristic $p$. Let $G_{\mathbf{Q}}$ be the absolute Galois group of the rational number field and fix an inertia subgroup $I_p\subset G_{\mathbf{Q}}$ at $p$. We prove that every continuous odd represent...

Yu-Fan Luo · 0 citations
Preprint Nov 2026

An explicit basis for the unipotent Specht modules of $\mathrm{GL}_n(\mathbb{F}_q)$

For each partition $\lambda$ of $n$ we construct an explicit basis of the unipotent Specht module $S^\lambda$ of $\mathrm{GL}_n(\mathbb{F}_q)$, defined recursively over horizontal strips. Each basis vector is $g\,x_\tau$, where $\tau$ is a semistandard tableau of shape $\lambda$, $x_\tau$ is obtained from a Steinberg-t...

Scott Andrews · 0 citations
Preprint Sep 2026

Conjugation Differential Invariants of $\mathrm{SL}_2(\mathbb{F}_q)$ on trace-free matrices

Let $q=p^k$ be prime power, let $F= \mathbb{F}_q$ and let $V$ be the vector space of 2 by 2 matrices over $F$ with trace zero. Let $G = \mathrm{SL}_2(F)$. Then $G$ acts on $V$ via conjugation. Let $\Omega = S(V^*) \otimes \Lambda(V^*)$ be the algebra of differential forms on $V$. A minimal generating set for $\Omega^G$...

Jonathan Elmer · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.