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 16x16 matrix on a 5-bit alphabet, yielding an efficient 80-bit diffusion layer with maximal branch number.
Type de document :
Communication dans un congrès
Lapidoth, Amos and Sason, Igal and Sayir, Jossy and Telatar, Emre. International Symposium on Information Theory (ISIT), 2013, Istambul, Turkey. IEEE, 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00823082
Contributeur : Matthieu Finiasz <>
Soumis le : jeudi 16 mai 2013 - 10:21:23
Dernière modification le : jeudi 11 janvier 2018 - 06:19:44

Identifiants

  • HAL Id : hal-00823082, version 1
  • ARXIV : 1305.3396

Collections

Citation

Daniel Augot, Matthieu Finiasz. Exhaustive Search for Small Dimension Recursive MDS Diffusion Layers for Block Ciphers and Hash Functions. Lapidoth, Amos and Sason, Igal and Sayir, Jossy and Telatar, Emre. International Symposium on Information Theory (ISIT), 2013, Istambul, Turkey. IEEE, 2013. 〈hal-00823082〉

Partager

Métriques

Consultations de la notice

386