Cryptology ePrint Archive: Report 2017/990

Bounds on the Differential Branch Number of Permutations

Sumanta Sarkar and Habeeb Syed

Abstract: Nonlinear permutations (S-boxes) are key components in block ciphers. Differential branch number measures the diffusion power of a permutation. Differential branch number of nonlinear permutations of $\mathbb{F}_2^n$ has not been analyzed, although it is well studied for linear permutations. In this paper we obtain a bound on differential branch number of permutations (both linear and nonlinear) of $\mathbb{F}_2^n$. We also show that in case of $\mathbb{F}_2^4$, the maximum differential branch number can be achieved only by affine permutations.

Category / Keywords: secret-key cryptography / Permutation, S-box, differential branch number, block cipher, Griesmer bound

Date: received 8 Oct 2017

Contact author: sumanta sarkar1 at tcs com, sumanta sarkar@gmail com

Available format(s): PDF | BibTeX Citation

Version: 20171011:141317 (All versions of this report)

Short URL: ia.cr/2017/990

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]