Orthogonal MDS Diffusion Matrices over Galois Rings

5Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

MDS matrices are important components in block cipher algorithm design, which provide diffusion of input bits. Recently, many constructions of MDS matrices focused on lightweight constructions. All MDS matrices constructions were over Galois field. In this paper, we give new construction of MDS matrices which is over Galois ring GR(2n,k)=ℤ2n[x]/(f(x)), where f(x) is a basic irreducible polynomial of degree k over ℤ2n. We first construct Hadamard matrices over U(GR(2n,K)) by adding some signs on the entries of the matrices (i.e. performing entry-wise multiplication with enabling Hadamard (1,-1)-matrices). We give complete enumerations of 4 X 4 and 8 X 8 enabling Hadamard (1,-1)-matrices. We prove that there is no 2 X 2 orthogonal MDS matrix over Galois ring GR(2n,k) and construct 4 X 4 orthogonal MDS matrices over GR(2n,k).

Cite

CITATION STYLE

APA

Tan, C. H., & Prabowo, T. F. (2017). Orthogonal MDS Diffusion Matrices over Galois Rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10655 LNCS, pp. 307–330). Springer Verlag. https://doi.org/10.1007/978-3-319-71045-7_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free