Near-MDS matrices provide better trade-offs between security and efficiency compared to constructions based on MDS matrices, which are favored for hardwareoriented designs. We present new designs of lightweight linear diffusion layers by constructing lightweight near-MDS matrices. Firstly generic n×n near-MDS circulant matrices are found for 5 ≤ n ≤ 9. Secondly , the implementation cost of inst...

We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here “binary matrix” means a matrix whose elements are drawn from {0, 1} or {−1, 1}. We describe efficient parallel algorithms for the search, using Duval’s algorithm for generation of Lyndon words and the well-known representation of the determinant of a circulant in terms of roots of unity....

In a previous work the authors presented necessary and sufficient conditions for invertibility of some circulant matrices that depend on three real parameters and, moreover, we obtained closed formula their inverse. The techniques used allowed us to reduce computational cost evaluating this complete theoretical analysis mentioned by considering complex also singular case. addition, explicitely ...

In the resolution of certain image deblurring problems with given boundary conditions we obtain two-level structured linear systems. In the case of shift-invariant point spread function with Dirichlet (zero) boundary conditions, the blurring matrices are block Toeplitz matrices with Toeplitz blocks. If the periodic boundary conditions are used, then the involved structures become block-circulan...