2013/05/15 by Daniel Augot, Augot, Daniel, Matthieu Finiasz +1 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #graph theory and CDMA systems
paper · doi:10.48550/arxiv.1305.3396
openalex publication_date 2013/05/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.