Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

On the construction of ultra-light MDS matrices

Yu Tian, Xiutao Feng, Guangrong Li

TL;DR

This paper begins implementation trees of MDS matrices, which is a vital tool for understanding and manipulating their implementations, and presents an algorithm that efficiently enumerates all the lightest MDS matrices based on the word representation.

Abstract

In recent years, the Substitution-Permutation Network has emerged as a crucial structure for constructing symmetric key ciphers. Composed primarily of linear matrices and nonlinear S-boxes, it offers a robust foundation for cryptographic security. Among the various metrics used to assess the cryptographic properties of linear matrices, the branch number stands out as a particularly important index. Matrices with an optimal branch number are referred to as MDS matrices and are highly prized in the field of cryptography. In this paper we delve into the construction of lightweight MDS matrices. We commence implementation trees of MDS matrices, which is a vital tool for understanding and manipulating their implementations, and then present an algorithm that efficiently enumerates all the lightest MDS matrices based on the word representation. As results, we obtain a series of ultra-lightweight $4\times 4$ MDS matrices, remarkably, 4-bit input MDS matrices with 35 XOR operations and 8-bit input ones with 67 XOR operations . These matrices represent the most comprehensive lightweight MDS matrices available to date. Furthermore, we craft some involution $4\times 4$ MDS matrices with a mere 68 XOR gates.To our best knowledge, they are the best up to date. In the realm of higher-order MDS matrices, we have successfully constructed $5\times 5$ and $6\times 6$ matrices with 114 and 148 XOR gates respectively. These findings outperform the current state-of-the-art.

On the construction of ultra-light MDS matrices

TL;DR

This paper begins implementation trees of MDS matrices, which is a vital tool for understanding and manipulating their implementations, and presents an algorithm that efficiently enumerates all the lightest MDS matrices based on the word representation.

Abstract

In recent years, the Substitution-Permutation Network has emerged as a crucial structure for constructing symmetric key ciphers. Composed primarily of linear matrices and nonlinear S-boxes, it offers a robust foundation for cryptographic security. Among the various metrics used to assess the cryptographic properties of linear matrices, the branch number stands out as a particularly important index. Matrices with an optimal branch number are referred to as MDS matrices and are highly prized in the field of cryptography. In this paper we delve into the construction of lightweight MDS matrices. We commence implementation trees of MDS matrices, which is a vital tool for understanding and manipulating their implementations, and then present an algorithm that efficiently enumerates all the lightest MDS matrices based on the word representation. As results, we obtain a series of ultra-lightweight MDS matrices, remarkably, 4-bit input MDS matrices with 35 XOR operations and 8-bit input ones with 67 XOR operations . These matrices represent the most comprehensive lightweight MDS matrices available to date. Furthermore, we craft some involution MDS matrices with a mere 68 XOR gates.To our best knowledge, they are the best up to date. In the realm of higher-order MDS matrices, we have successfully constructed and matrices with 114 and 148 XOR gates respectively. These findings outperform the current state-of-the-art.
Paper Structure (20 sections, 6 theorems, 59 equations, 13 figures, 10 tables, 3 algorithms)

This paper contains 20 sections, 6 theorems, 59 equations, 13 figures, 10 tables, 3 algorithms.

Table of Contents

  1. Introduction
  2. Related works
  3. Our contributions
  4. Organization of the paper
  5. Preliminaries
  6. MDS matrix
  7. Cost and depth of binary matrices
  8. Metric
  9. The construction of lightweight $4\times4$ MDS matrices
  10. Implementation tree
  11. An algorithm for searching the simplest tree
  12. Feasible structures
  13. The $4\times 4$ MDS matrices with the lowest cost on $R_8$
  14. Construction of $4\times 4$ Involutory MDS Matrices
  15. Construction of higher order MDS matrices
  16. ...and 5 more sections

Key Result

Theorem 1

Let $R_n$ be a commutative ring and $M$ be a $k \times k$ matrix over $R_n$. Then $M$ is an MDS matrix if and only if all of its minors are invertible.

Figures (13)

  • Figure 1: An implementation $I$ of $M$
  • Figure 2: Another implementation $I'$ of $M$
  • Figure 3: The implementation tree of the MixColumn matrix of AES
  • Figure 4: An implementation tree for a $5\times 5$ MDS matrix.
  • Figure 5: An implementation tree for a $6\times 6$ MDS matrix
  • ...and 8 more figures

Theorems & Definitions (18)

  • Definition 1
  • Theorem 1: Au2013Exhaustivesearch
  • Theorem 2
  • Definition 2
  • Definition 3
  • Definition 4
  • Theorem 3
  • Example 1
  • Theorem 4
  • proof
  • ...and 8 more