MDS matrices from skew polynomials with automorphisms and derivations
Abstract
Maximum Distance Separable (MDS) matrices play a central role in coding theory and symmetric-key cryptography due to their optimal diffusion properties. In this paper, we present a construction of MDS matrices using skew polynomial rings \( Fq[X;θ,δ] \), where \( θ \) is an automorphism and \( δ \) is a \( θ\)-derivation on \( Fq \). We introduce the notion of \( δθ \)-circulant matrices and study their structural properties. Necessary and sufficient conditions are derived under which these matrices are involutory and satisfy the MDS property. The resulting δθ-circulant matrix can be viewed as a generalization of classical constructions obtained in the absence of θ-derivations. One of the main contribution of this work is the construction of quasi recursive MDS matrices. In the setting of the skew polynomial ring Fq[X;θ], we construct quasi recursive MDS matrices associated with companion matrices. These matrices are shown to be involutory, yielding a strict improvement over the quasi-involutory constructions previously reported in the literature. Several illustrative results and examples are also provided.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.