Quasi-recursive MDS Matrices over Galois Rings

TL;DR

This paper introduces new methods for constructing quasi-recursive MDS matrices over Galois rings using skew polynomial rings, extending existing theories and enabling applications in cryptography.

Contribution

It develops criteria for recursive MDS matrices, generalizes to non-commutative settings, and provides construction techniques for matrices over Galois rings.

Findings

Criteria for recursive MDS matrices established

Construction methods for skew polynomials developed

Framework extends known constructions to non-commutative rings

Abstract

Let $p$ be a prime and $s,m,n$ be positive integers. This paper studies quasi-recursive MDS matrices over Galois rings $GR(p^{s}, p^{sm})$ and proposes various direct construction methods for such matrices. The construction is based on skew polynomial rings $GR(p^{s}, p^{sm})[X;\sigma]$, whose rich factorization properties and enlarged class of polynomials are used to define companion matrices generating quasi-recursive MDS matrices. First, two criteria are established for characterizing polynomials that yield recursive MDS matrices, generalizing existing results, and then an additional criterion is derived in terms of the right roots of the associated Wedderburn polynomial. Using these criteria, methods are developed to construct skew polynomials that give rise to quasi-recursive MDS matrices over Galois rings. This framework extends known constructions to the non-commutative setting and significantly enlarges the family of available matrices, with potential applications to efficient diffusion layers in cryptographic primitives. The results are particularly relevant for practical implementations when $s = 1$ and $p = 2$, i.e., over the finite field $\mathbb{F}_{2^m}$, which is of central interest in real-world cryptographic applications.