On Efficient Constructions of Lightweight MDS Matrices

Authors

  • Lijing Zhou State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications, Beijing, China
  • Licheng Wang State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications, Beijing, China
  • Yiru Sun State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications, Beijing, China

DOI:

https://doi.org/10.13154/tosc.v2018.i1.180-200

Keywords:

MDS matrix, XOR count, matrix polynomial residue ring, involutory matrix

Abstract

The paper investigates the maximum distance separable (MDS) matrix over the matrix polynomial residue ring. Firstly, by analyzing the minimal polynomials of binary matrices with 1 XOR count and element-matrices with few XOR counts, we present an efficient method for constructing MDS matrices with as few XOR counts as possible. Comparing with previous constructions, our corresponding constructions only cost 1 minute 27 seconds to 7 minutes, while previous constructions cost 3 days to 4 weeks. Secondly, we discuss the existence of several types of involutory MDS matrices and propose an efficient necessary-and-sufficient condition for identifying a Hadamard matrix being involutory. According to the condition, each involutory Hadamard matrix over a polynomial residue ring can be accurately and efficiently searched. Furthermore, we devise an efficient algorithm for constructing involutory Hadamard MDS matrices with as few XOR counts as possible. We obtain many new involutory Hadamard MDS matrices with much fewer XOR counts than optimal results reported before.

Published

2018-03-01

Issue

Section

Articles

How to Cite

On Efficient Constructions of Lightweight MDS Matrices. (2018). IACR Transactions on Symmetric Cryptology, 2018(1), 180-200. https://doi.org/10.13154/tosc.v2018.i1.180-200