On the construction of ultra-light MDS matrices
Yu Tian, Xiutao Feng, Guangrong Li

TL;DR
This paper presents the construction of ultra-lightweight MDS matrices for cryptography, including algorithms and implementations that yield the most efficient matrices to date, significantly reducing XOR operations needed.
Contribution
It introduces a novel algorithm for enumerating lightweight MDS matrices and provides the most efficient known constructions for various sizes, advancing cryptographic matrix design.
Findings
4-bit MDS matrices with 35 XOR operations
8-bit MDS matrices with 67 XOR operations
Constructed 5x5 and 6x6 MDS matrices with 114 and 148 XOR gates
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPhotonic and Optical Devices · Optical Wireless Communication Technologies · Advanced Photonic Communication Systems
