In cryptography, the branch number is a numerical value that characterizes the amount of diffusion introduced by a vectorial Boolean function F that maps an input vector a to output vector . For the (usual[1]) case of a linear F the value of the differential branch number is produced by:

  1. applying nonzero values of a (i.e., values that have at least one non-zero component of the vector) to the input of F;
  2. calculating for each input value a the Hamming weight (number of nonzero components), and adding weights and together;
  3. selecting the smallest combined weight across for all nonzero input values: .

If both a and have s components, the result is obviously limited on the high side by the value (this "perfect" result is achieved when any single nonzero component in a makes all components of to be non-zero). A high branch number suggests higher resistance to the differential cryptanalysis: the small variations of input will produce large changes on the output and in order to obtain small variations of the output, large changes of the input value will be required.[2]

The term was introduced by Daemen and Rijmen in early 2000s and quickly became a typical tool to assess the diffusion properties of the transformations.[1]

Mathematics

The branch number concept is not limited to the linear transformations, Daemen and Rijmen provided two general metrics:[3]

  • differential branch number, where the minimum is obtained over inputs of F that are constructed by independently sweeping all the values of two nonzero and unequal vectors a, b ( is a component-by-component exclusive-or): ;
  • for linear branch number, the independent candidates and are independently swept; they should be nonzero and correlated with respect to F (the coefficient of the linear approximation table of F should be nonzero): .[4]

References

  1. 1 2 Zhang et al. 2009, p. 327.
  2. Liu & Sim 2016, p. 105.
  3. Daemen & Rijmen 2013, pp. 131–132.
  4. SAGE. "S-Boxes and Their Algebraic Representations". sagemath.org. SageMath. Retrieved 25 April 2023.

Sources

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.