@article{Li_Sun_Shi_Li_Hu_2020, title={Lightweight Iterative MDS Matrices: How Small Can We Go?}, volume={2019}, url={https://tosc.iacr.org/index.php/ToSC/article/view/8460}, DOI={10.13154/tosc.v2019.i4.147-170}, abstractNote={<p>As perfect building blocks for the diffusion layers of many symmetric-key primitives, the construction of MDS matrices with lightweight circuits has received much attention from the symmetric-key community. One promising way of realizing low-cost MDS matrices is based on the iterative construction: a low-cost matrix becomes MDS after rising it to a certain power. To be more specific, if A<sup><em>t</em></sup> is MDS, then one can implement A instead of A<sup><em>t</em></sup> to achieve the MDS property at the expense of an increased latency with <em>t</em> clock cycles. In this work, we identify the <em>exact lower bound</em> of the number of nonzero blocks for a 4 × 4 block matrix to be potentially iterative-MDS. Subsequently, we show that the <em>theoretically lightest</em> 4 × 4 iterative MDS block matrix (whose entries or blocks are 4 × 4 binary matrices) with minimal nonzero blocks costs at least 3 XOR gates, and a concrete example achieving the 3-XOR bound is provided. Moreover, we prove that there is no hope for previous constructions (GFS, LFS, DSI, and spares DSI) to beat this bound. Since the circuit latency is another important factor, we also consider the lower bound of the number of iterations for certain iterative MDS matrices. Guided by these bounds and based on the ideas employed to identify them, we explore the design space of lightweight iterative MDS matrices with other dimensions and report on improved results. Whenever we are unable to find better results, we try to determine the bound of the optimal solution. As a result, the optimality of some previous results is proved.</p>}, number={4}, journal={IACR Transactions on Symmetric Cryptology}, author={Li, Shun and Sun, Siwei and Shi, Danping and Li, Chaoyun and Hu, Lei}, year={2020}, month={Jan.}, pages={147–170} }