English

A note on cyclic MDS and non-MDS matrices

Cryptography and Security 2025-01-08 v2

Abstract

In 1998,1998, Daemen {\it{ et al.}} introduced a circulant Maximum Distance Separable (MDS) matrix in the diffusion layer of the Rijndael block cipher, drawing significant attention to circulant MDS matrices. This block cipher is now universally acclaimed as the AES block cipher. In 2016,2016, Liu and Sim introduced cyclic matrices by modifying the permutation of circulant matrices and established the existence of MDS property for orthogonal left-circulant matrices, a notable subclass within cyclic matrices. While circulant matrices have been well-studied in the literature, the properties of cyclic matrices are not. Back in 19611961, Friedman introduced gg-circulant matrices which form a subclass of cyclic matrices. In this article, we first establish a permutation equivalence between a cyclic matrix and a circulant matrix. We explore properties of cyclic matrices similar to gg-circulant matrices. Additionally, we determine the determinant of gg-circulant matrices of order 2d×2d2^d \times 2^d and prove that they cannot be simultaneously orthogonal and MDS over a finite field of characteristic 22. Furthermore, we prove that this result holds for any cyclic matrix.

Cite

@article{arxiv.2406.14013,
  title  = {A note on cyclic MDS and non-MDS matrices},
  author = {Tapas Chatterjee and Ayantika Laha},
  journal= {arXiv preprint arXiv:2406.14013},
  year   = {2025}
}

Comments

18 pages

R2 v1 2026-06-28T17:12:57.949Z