Cryptology ePrint Archive: Report 2016/751

Feistel Like Construction of Involutory Binary Matrices With High Branch Number

Adnan Baysal and Mustafa Çoban and Mehmet Özen

Abstract: In this paper, we propose a generic method to construct involutory binary matrices from a three round Feistel scheme with a linear round function. We prove bounds on the maximum achievable branch number (BN) and the number of fixed points of our construction. We also define two families of efficiently implementable round functions to be used in our method. The usage of these families in the proposed method produces matrices achieving the proven bounds on branch numbers and fixed points. Moreover, we show that BN of the transpose matrix is the same with the original matrix for the function families we defined. Some of the generated matrices are \emph{Maximum Distance Binary Linear} (MDBL), i.e. matrices with the highest achievable BN. The number of fixed points of the generated matrices are close to the expected value for a random involution. Generated matrices are especially suitable for utilising in bitslice block ciphers and hash functions. They can be implemented efficiently in many platforms, from low cost CPUs to dedicated hardware.

Category / Keywords: secret-key cryptography / Diffusion layer, bitslice cipher, hash function, involution, MDBL matrices, Fixed points

Date: received 4 Aug 2016

Contact author: adnan baysal at tubitak gov tr

Available format(s): PDF | BibTeX Citation

Version: 20160808:134932 (All versions of this report)

Short URL: ia.cr/2016/751

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]