On Constructions of MDS Matrices from Companion Matrices for Lightweight CryptographyReportar como inadecuado

On Constructions of MDS Matrices from Companion Matrices for Lightweight Cryptography - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 Applied Statistics Unit

Abstract : Maximum distance separable MDS matrices have applications not only in coding theory but also are of great importance in the design of block ciphers and hash functions. It is highly nontrivial to find MDS matrices which could be used in lightweight cryptography. In a crypto 2011 paper, Guo et. al. proposed a new MDS matrix Serial1,2,1,44 over $\mathbb{F} {2^8}$. This representation has a compact hardware implementation of the AES MixColumn operation. No general study of MDS properties of this newly introduced construction of the form Serialz0,…,zd − 1d over $\mathbb{F} {2^n}$ for arbitrary d and n is available in the literature. In this paper we study some properties of MDS matrices and provide an insight of why Serialz0,…,zd − 1d leads to an MDS matrix. For efficient hardware implementation, we aim to restrict the values of zi’s in {1,α,α2,α + 1}, such that Serialz0,…,zd − 1d is MDS for d = 4 and 5, where α is the root of the constructing polynomial of $\mathbb{F} {2^n}$. We also propose more generic constructions of MDS matrices e.g. we construct lightweight 4 ×4 and 5 ×5 MDS matrices over $\mathbb{F} {2^n}$ for all n ≥ 4. An algorithm is presented to check if a given matrix is MDS. The algorithm follows from the basic properties of MDS matrix and is easy to implement.

Keywords : Diffusion Companion matrix MDS matrix MixColumn operation minimal polynomial

Autor: Kishan Gupta - Indranil Ray -

Fuente: https://hal.archives-ouvertes.fr/


Documentos relacionados