Double-Matrix: Complete Diffusion in a Single Round with (small) MDS Matrices

Jorge Nakahara Jr

Paper 2024/1624

Double-Matrix: Complete Diffusion in a Single Round with (small) MDS Matrices

Jorge Nakahara Jr, researcher

Abstract

This paper describes a simple idea to improve (text) diffusion in block ciphers that use MDS codes but that take more than a single round to achieve full (text) diffusion. The Rijndael cipher family is used as an example since it comprises ciphers with different state sizes. A drawback of the new approach is the additional computational cost, but it is competitive compared to large MDS matrices used in the Khazad and Kuznyechik ciphers.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
Keywords: efficient diffusion Maximum Distance Separable codes block ciphers SPN designs.
Contact author(s): jorge_nakahara @ yahoo com br
History: 2024-11-14: revised; 2024-10-10: received; See all versions
Short URL: https://ia.cr/2024/1624
License: CC BY

BibTeX

@misc{cryptoeprint:2024/1624,
      author = {Jorge Nakahara Jr},
      title = {Double-Matrix: Complete Diffusion in a Single Round with (small) {MDS} Matrices},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1624},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1624}
}