On constructing of a 32 × 32 binary matrix as a diffusion layer for a 256-bit block cipher

Citations

SCOPUS

27

초록

In this paper, we describe how to construct a 32 ×32 binary matrix of branch number 10, and use some mathematical techniques to find a form in product of matrices for increasing efficiency in software implementations of the binary matrix. We estimate a security against cryptanlysis when the binary matrix is used as a diffusion layer of a 256-bit SPN block cipher with an 8-bit s-box as a substitution layer in a round function. Also we describe the cryptanalytic properties such as the resistances to differential, linear, impossible differential, and truncated differential cryptanalysis. The number of operations to be required for implementing the binary matrix as a diffusion layer of a 256-bit SPN block cipher are given in this paper. We have a result that the binary matrix A is more efficient than the diffusion layer used Rijndael-256 on low bit platforms, such as 8-bit processors.

키워드

Block cipherDiffusion layerHinary matrixSPNComputational complexityNumber theoryPublic key cryptographySecurity of dataBinary matrixBlock cipherDiffusion layerBinary sequences
제목
On constructing of a 32 × 32 binary matrix as a diffusion layer for a 256-bit block cipher
저자
Koo, Bon WookJang, Hwan SeokSong, Jung Hwan
DOI
10.1007/11927587_7
발행일
2006-12
유형
Conference Paper
저널명
Lecture Notes in Computer Science
4296 LNCS
페이지
51 ~ 64