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 this paper, we propose a new heuristic algorithm to search efficient implementations (in
terms of Xor count) of linear layers used in symmetric-key cryptography. It is observed that …

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 …

At the FSE conference of ToSC 2018, Kranz et al. presented their results on shortest linear
programs for the linear layers of several well known block ciphers in literature. Shortest …

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 …

In recent years quantum computing has developed rapidly. The security threat posed by
quantum computing to cryptography makes it necessary to better evaluate the resource cost …

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 …

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 …

Synthesis and optimization of quantum circuits are important and fundamental research
topics in quantum computation, due to the fact that qubits are very precious and …

In this paper, we propose a new matrix form to generate all 3× 3 involutory and MDS
matrices over F 2 m and prove that the number of all 3× 3 involutory and MDS matrices over …