The Twofish encryption algorithm: a 128-bit block cipher
The Twofish encryption algorithm: a 128-bit block cipher
The Design of Rijndael
FOX: a new family of block ciphers
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Looking Back at a New Hash Function
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Linear cryptanalysis of non binary ciphers
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
FOX: a new family of block ciphers
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Integral cryptanalysis of reduced FOX block cipher
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
On construction of involutory MDS matrices from Vandermonde Matrices in GF(2q)
Designs, Codes and Cryptography
Recursive diffusion layers for block ciphers and hash functions
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
| Hi-index | 0.00 |
Although linear perfect diffusion primitives, i.e. MDS matrices, are widely used in block ciphers, e.g. AES, very little systematic work has been done on how to find “efficient” ones. In this paper we attempt to do so by considering software implementations on various platforms. These considerations lead to interesting combinatorial problems: how to maximize the number of occurrences of 1 in those matrices, and how to minimize the number of pairwise different entries. We investigate these problems and construct efficient 4 × 4 and 8 × 8 MDS matrices to be used e.g. in block ciphers.