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 [Formula Present], 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 [Formula Present]. We also prove that in the case of [Formula Present], the maximum differential branch number can be achieved only by affine permutations.
CITATION STYLE
Sarkar, S., & Syed, H. (2018). Bounds on differential and linear branch number of permutations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10946 LNCS, pp. 207–224). Springer Verlag. https://doi.org/10.1007/978-3-319-93638-3_13
Mendeley helps you to discover research relevant for your work.