Teichmüller Sets in Galois Rings

• The Teichmüller set in a Galois ring is a canonical collection of representatives that ensures unique p-adic expansions and preserves unit properties.
• It supports explicit Cauchy MDS matrix constructions via difference and sum forms, guaranteeing that all necessary elements remain invertible.
• Frobenius automorphisms and isomorphic mappings further extend these constructions, offering a vast family of cryptographic and coding matrices with proven MDS properties.

A Teichmüller set in the context of Galois rings plays a fundamental role in the construction and analysis of structured matrices, particularly Cauchy maximum distance separable (MDS) matrices over finite commutative local rings. The Teichmüller set provides canonical representatives that preserve crucial algebraic properties, enable efficient parameterizations for mathematical and cryptographic constructions, and facilitate the definition of automorphisms and isomorphisms. Specifically, in a Galois ring $GR(p^s,p^{s m})$, which generalizes finite fields to rings of characteristic $p^s$, the Teichmüller set underpins both the explicit algebraic structure of elements and the guarantees regarding invertibility and MDS properties necessary for matrix-based coding and cryptographic primitives (Ali et al., 22 Dec 2025).

1. Structure of the Galois Ring and Teichmüller Set

Let $p$ be a prime and $s, m \geq 1$. Given a monic basic-irreducible polynomial $f(x)\in\mathbb{Z}_{p^s}[x]$ of degree $m$, the Galois ring is

$GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$

a finite commutative local ring with characteristic $p^s$ and order $p^{sm}$.

Within $GR(p^s, p^{sm})$, a root $p^s$0 of a basic-primitive polynomial of degree $p^s$1 serves as a lift of a primitive element of $p^s$2, satisfying $p^s$3. The Teichmüller set is defined by

$p^s$4

with $p^s$5 denoting its nonzero part ($p^s$6), a cyclic group of order $p^s$7. Any element $p^s$8 admits a unique $p^s$9-adic expansion:

$p$0

The set of nilpotent elements coincides with the ideal $p$1, explicitly $p$2.

2. Explicit Cauchy MDS Matrix Constructions Using Teichmüller Representatives

Cauchy MDS matrices over $p$3 are constructed such that each entry is the inverse of a unit. Utilizing Teichmüller representatives ensures that all required differences and sums remain units, guaranteeing MDS properties.

• Type I (difference form): For distinct $p$4:

$p$5

All $p$6, $p$7, and $p$8 are units. Every submatrix has the same form, maintaining the MDS property ((Ali et al., 22 Dec 2025), Theorem 3.1).

• Type II (sum form, $p$9): Let $s, m \geq 1$0, select distinct $s, m \geq 1$1:

$s, m \geq 1$2

Provided $s, m \geq 1$3 in $s, m \geq 1$4, all entries are invertible ((Ali et al., 22 Dec 2025), Theorem 3.2).

• Symmetric reduced-entry form with nilpotents: Fix $s, m \geq 1$5, choose distinct $s, m \geq 1$6, let $s, m \geq 1$7:

$s, m \geq 1$8

This uses at most $s, m \geq 1$9 unique ring elements, optimizing resource usage in implementations ((Ali et al., 22 Dec 2025), Theorem 3.2b).

3. MDS Conditions via Teichmüller Set Properties

A matrix is MDS over a ring if all $f(x)\in\mathbb{Z}_{p^s}[x]$0 minors have unit determinant. For Cauchy matrices over $f(x)\in\mathbb{Z}_{p^s}[x]$1, this property holds if and only if denominators $f(x)\in\mathbb{Z}_{p^s}[x]$2 are units.

• Type I: No extra restriction on $f(x)\in\mathbb{Z}_{p^s}[x]$3; $f(x)\in\mathbb{Z}_{p^s}[x]$4 are selected as distinct nonzero Teichmüller representatives ($f(x)\in\mathbb{Z}_{p^s}[x]$5).
• Type II: Requires $f(x)\in\mathbb{Z}_{p^s}[x]$6 and restriction to "half" the Teichmüller set $f(x)\in\mathbb{Z}_{p^s}[x]$7, ensuring $f(x)\in\mathbb{Z}_{p^s}[x]$8 modulo $f(x)\in\mathbb{Z}_{p^s}[x]$9.

This reliance on the Teichmüller set underpins combinatorial uniqueness and prevents zero-divisors, as rigorously established in (Ali et al., 22 Dec 2025), Theorems 3.1–3.3.

4. Frobenius Automorphisms and MDS Family Generation

The Frobenius automorphism

$m$0

has order $m$1 on $m$2, acting as $m$3 and fixing $m$4. Application of $m$5 or its iterates to a matrix $m$6 yields:

$m$7

which remains MDS wherever $m$8 is MDS, since $m$9. Scaling by units $GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$0 extends this further. The total number of maps

$GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$1

is at least $GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$2, ensuring a large variety of MDS matrices obtainable from a single seed ((Ali et al., 22 Dec 2025), Theorem 3.6).

5. Automorphisms, Isomorphisms, and Further Matrix Constructions

• Within-ring automorphisms: For $GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$3 MDS in $GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$4, matrices

$GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$5

with $GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$6 and $GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$7 are also MDS, due to determinant preservation.

• Isomorphisms between presentations: For two Galois rings $GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$8 and $GR(p^s, p^{sm}) \cong \mathbb{Z}_{p^s}[x]/(f(x)),$9 with primitive roots $p^s$0, mappings $p^s$1 (with $p^s$2) induce isomorphisms $p^s$3 such that, if $p^s$4 is MDS over the first ring, $p^s$5 is MDS over the second ((Ali et al., 22 Dec 2025), Prop. 4.4). There are $p^s$6 such compositions.

6. Practical Significance and Implementation Advantages

Teichmüller-set–based constructions ensure all matrix denominators are invertible, which is central to the MDS property. The usage of nilpotent elements for reduced-entry symmetric Cauchy matrices minimizes the inventory of required ring elements, leading to efficiencies in both hardware and software implementations. Frobenius automorphisms and isomorphism techniques allow the generation of extensive families of MDS matrices from a single seed, providing flexibility and cryptographic diversity in the design of diffusion layers for symmetric-key algorithms. Together, these approaches offer explicit formulae, provable MDS-ness, and a vast configuration space for design and optimization (Ali et al., 22 Dec 2025).