4n × 4n diffusion layers based on multiple 4 × 4 mds matrices

In terms of security, mds matrices are one of the best choices for the diffusion layer of block ciphers. however, as these matrices grow in size, their software implementation becomes a challenge. in this paper, to benefit from the properties of mds matrices and avoid the mentioned challenge, we use 4 × 4 mds matrices to build some 16 × 16 matrices with a low number of zero elements. we show that if these matrices are used as diffusion layers of software-based spn structures, the resulting block ciphers have similar properties as aes in software implementation complexity (i.e. the number of required cpu instructions) and resistance against linear and differential attacks. moreover, the best impossible differential and square distinguishers for the proposed 16 × 16 structures have a similar length as spn structures with 16 × 16 mds matrices. thus, the new structures outperform aes concerning the impossible differential and square attacks. additionally, we show that if the proposed spn structure uses the aes key schedule, its results for the differential related-key attacks are better than those for aes. we also extend the idea and use 4×4 mds matrices to design 24×24 and 32×32 matrices with acceptable properties for spn structure design. finally, we extend the idea to propose some matrices for feistel structures with sp-type f-functions. we show that the resulting structures are more secure than the improved type-ii gfs.