Exhaustive Search for Small Dimension Recursive MDS Diffusion Layers for Block Ciphers and Hash Functions
Cryptography and Security
2013-05-16 v1
Abstract
This article presents a new algorithm to find MDS matrices that are well suited for use as a diffusion layer in lightweight block ciphers. Using an recursive construction, it is possible to obtain matrices with a very compact description. Classical field multiplications can also be replaced by simple F2-linear transformations (combinations of XORs and shifts) which are much lighter. Using this algorithm, it was possible to design a 16x16 matrix on a 5-bit alphabet, yielding an efficient 80-bit diffusion layer with maximal branch number.
Keywords
Cite
@article{arxiv.1305.3396,
title = {Exhaustive Search for Small Dimension Recursive MDS Diffusion Layers for Block Ciphers and Hash Functions},
author = {Daniel Augot and Matthieu Finiasz},
journal= {arXiv preprint arXiv:1305.3396},
year = {2013}
}
Comments
Published at ISIT 2013