Finite field for scientists and engineers
Finite field for scientists and engineers
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Design of Rijndael
Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms - Design and Analysis
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Differential and linear cryptanalysis for 2-round SPNs
Information Processing Letters
On constructing of a 32 ×32 binary matrix as a diffusion layer for a 256-bit block cipher
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
On construction of involutory MDS matrices from Vandermonde Matrices in GF(2q)
Designs, Codes and Cryptography
| Hi-index | 7.29 |
Binary linear transformations (also called binary matrices) have matrix representations over GF(2). Binary matrices are used as diffusion layers in block ciphers such as Camellia and ARIA. Also, the 8x8 and 16x16 binary matrices used in Camellia and ARIA, respectively, have the maximum branch number and therefore are called Maximum Distance Binary Linear (MDBL) codes. In the present study, a new algebraic method to construct cryptographically good 32x32 binary linear transformations, which can be used to transform a 256-bit input block to a 256-bit output block, is proposed. When constructing these binary matrices, the two cryptographic properties; the branch number and the number of fixed points are considered. The method proposed is based on 8x8 involutory and non-involutory Finite Field Hadamard (FFHadamard) matrices with the elements of GF(2^4). How to construct 32x32 involutory binary matrices of branch number 12, and non-involutory binary matrices of branch number 11 with one fixed point, are described.