Cryptology ePrint Archive: Report 2016/1173

Construction of Lightweight MDS Matrices over the Matrix Polynomial Residue Ring

Lijing Zhou, Licheng Wang and Yiru Sun

Abstract: In this article, we investigate the construction of lightweight MDS matrices over the matrix polynomial residue ring. According to distributions of the minimum polynomial, distributions of XOR count and equivalence classes of MDS matrices, we propose an algorithm, which not only can construct lightest MDS matrices, but also is evidently more efficient than previous methods. Moreover, we investigate existences of involutory MDS matrices over the matrix polynomial residue ring. According to quadratic congruence, over the matrix polynomial residue ring, we propose a simplified necessary-and-sufficient condition for deciding whether a Hadamard matrix is invorlutory. With this method, we propose another efficient and special algorithm to construct lightweight Hadamard involutory MDS matrices. Over the $8\times8$ matrix polynomial residue ring, we construct vast $4\times4$ Hadamard involutory MDS matrices with 20 XORs, which are much lighter than previous results. In addition, we obtain a series of propositions about the parity of XOR count.

Category / Keywords: MDS matrix, XOR count, Matrix polynomial residue ring, Involutory matrix

Date: received 20 Dec 2016, last revised 30 Jan 2017

Contact author: 379739494 at qq com

Available format(s): PDF | BibTeX Citation

Note: Publish the full version of my paper.

Version: 20170131:063443 (All versions of this report)

Short URL: ia.cr/2016/1173

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]