[Resource Topic] 2017/990: Bounds on Differential and Linear Branch Number of Permutations

Welcome to the resource topic for 2017/990

Bounds on Differential and Linear Branch Number of Permutations

Authors: Sumanta Sarkar, Habeeb Syed


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.

ePrint: https://eprint.iacr.org/2017/990

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .