Recently a lot of attention is paid to the search for efficiently implementable MDS matrices for
lightweight symmetric primitives. Most previous work concentrated on locally optimizing the …

Designing a block cipher or cryptographic permutation can be approached in many different
ways. One such approach, popularized by AES, consists in grouping the bits along the S …

MDS matrices are important building blocks providing diffusion functionality for the design of
many symmetric-key primitives. In recent years, continuous efforts are made on the …

Combinatorial designs are closely related to linear codes. Recently, some near MDS codes
were employed to construct-designs by Ding and Tang, which settles the question as to …

A linear code with parameters of the form [n, k, n− k+ 1] is referred to as an MDS (maximum
distance separable) code. A linear code with parameters of the form [n, k, n− k] is said to be …

The optimal branch number of MDS matrices makes them a preferred choice for designing
diffusion layers in many block ciphers and hash functions. Consequently, various methods …

In this paper, we propose several reduction rules to optimize the given implementation of a
binary matrix over F 2. Moreover, we design a top-layer framework which can make use of …

Ever since lightweight cryptography emerged as one of the trending topics in symmetric key
cryptography, optimizing the implementation cost of MDS matrices has been in the center of …

Maximum Distance Separable (MDS) matrices are used as the main component of diffusion
layers in block ciphers. MDS matrices have the optimal diffusion properties and the …

A recent work from Eurocrypt 2023 suggests that prime-field masking has excellent potential
to improve the efficiency vs. security tradeoff of masked implementations against side …