A new construction of lightweight MDS matrices

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Since maximum distance separable (MDS) matrices can be used as the best building blocks of diffusion layer of block cipher or hash functions, extensive studies have been investigated. In this article, we provide a new method to search lightweight MDS matrices. By providing a new matrix representation of elements of finite fields and observing the special form of the matrices, we exhibit new search algorithms that greatly reduce the search space and make lightweight MDS matrices with low XOR counts. We provide the non-involutory MDS matrices with the least possible XOR gates for dimension 4×4 over finite fields GF(24) and GF(28) respectively. Compared to the best known matrices, our new candidates have advantages for hardware implementation.

Original languageEnglish
Title of host publication2017 3rd IEEE International Conference on Computer and Communications, ICCC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2560-2563
Number of pages4
ISBN (Electronic)9781509063505
DOIs
StatePublished - 2 Jul 2017
Event3rd IEEE International Conference on Computer and Communications, ICCC 2017 - Chengdu, China
Duration: 13 Dec 201716 Dec 2017

Publication series

Name2017 3rd IEEE International Conference on Computer and Communications, ICCC 2017
Volume2018-January

Conference

Conference3rd IEEE International Conference on Computer and Communications, ICCC 2017
Country/TerritoryChina
CityChengdu
Period13/12/1716/12/17

Keywords

  • MDS matrix
  • XOR counts
  • companion matrix

Fingerprint

Dive into the research topics of 'A new construction of lightweight MDS matrices'. Together they form a unique fingerprint.

Cite this