A matrix is MDS or super-regular if and only if every square submatrices of it are
nonsingular. MDS matrices provide perfect diffusion in block ciphers and hash functions. In …

In the present paper, we investigate the problem of constructing MDS matrices with as few
bit XOR operations as possible. The key contribution of the present paper is constructing …

This article presents a new hybrid method (combining search based methods and direct
construction methods) to generate all 4× 4 involutory maximum distance separable (MDS) …

In this study, the authors generalise Hadamard matrix over and propose a new form of
Hadamard matrix, which they call generalised Hadamard (GHadamard) matrix. Then, they …

MDS matrices incorporate diffusion layers in block ciphers and hash functions. MDS
matrices are in general not sparse and have a large description and thus induce costly …

Maximum distance separable (MDS) matrices have applications not only in coding theory
but are also of great importance in the design of block ciphers and hash functions. It is highly …

Many recent block ciphers use Maximum Distance Separable (MDS) matrices in their
diffusion layer. The main objective of this operation is to spread as much as possible the …

BGD'nin vizyonu;“bilgi güvenliği alanında ulusal ve uluslararası düzeyde tarafsız, güvenilir
ve et in bir ulusal sivil toplum uruluşu olma tır.” BGD amacı doğrultusunda; tüm paydaşlarla …

A recursive MDS matrix is an MDS matrix which can be expressed as a power of some
companion matrix. The advantage of such a matrix is that it can be implemented by a single …

MDS matrices are of great importance in the design of block ciphers and hash functions.
MDS matrices are not sparse and have a large description and thus induce costly …