Cryptology ePrint Archive: Report 2017/990

Bounds on Differential and Linear Branch Number of Permutations

Sumanta Sarkar and Habeeb Syed

Abstract: Nonlinear permutations (S-boxes) are key components in block ciphers. The differential branch number measures the diffusion power of a permutation, whereas the linear branch number measures resistance against linear cryptanalysis. There has not been much analysis done on the differential branch number of nonlinear permutations of $\mathbb{F}_2^n$, although it has been well studied in case of linear permutations. Similarly upper bounds for the linear branch number have also not been studied in general. In this paper we obtain bounds for both the differential and the linear branch number of permutations (both linear and nonlinear) of $\mathbb{F}_2^n$. We also prove that in the case of $\mathbb{F}_2^4$, the maximum differential branch number can be achieved only by affine permutations.

Category / Keywords: Permutation, S-box, differential branch number, linear branch number, block cipher, Griesmer bound.

Original Publication (in the same form): ACISP 2018

Date: received 8 Oct 2017, last revised 11 May 2018

Contact author: sumanta sarkar at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20180511:093759 (All versions of this report)

Short URL: ia.cr/2017/990

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]