Branch-and-bound optimization of algorithm for computing guaranteed number of activations in XS-circuits
Abstract:
The guaranteed number of activations is an important cryptographic a characteristic that allows one to obtain an estimate of the security of a block cipher to differential cryptanalysis. This paper proposes an approach to optimization of the existing algorithm for calculating the guaranteed number activations using the branch and bound method, as well as analysis special matrices characterizing the XS-scheme. For multiple ciphers computational experiments have been carried out that demonstrate significant acceleration of the calculation of the guaranteed number of activations by compared with known approaches.
