@inproceedings{41532630da9449fba3a4fe5c3b747836,
title = "Exhaustive search for small dimension recursive MDS diffusion layers for block ciphers and hash functions",
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 16{\texttimes}16 matrix on a 5-bit alphabet, yielding an efficient 80-bit diffusion layer with maximal branch number.",
keywords = "Block ciphers, Branch number, Companion matrices, Generalised Feistel, MDS codes, MDS conjecture, Singleton bound",
author = "Daniel Augot and Matthieu Finiasz",
year = "2013",
month = jan,
day = "1",
doi = "10.1109/ISIT.2013.6620487",
language = "English",
isbn = "9781479904464",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1551--1555",
booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",
note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",
}