On parallel computations in implementation of the meat-in-the-middle attack

Three variants of implementations of the meat-in-the-middle attack based on clusters and distributed computations are considered for symmetric block cryptosystems. The average time of computations is estimated in universal proposition on equiprobability keys of cryptosystem. It is shown that the coefficient of curtailing for average time attains the number of processors comparing to monoprocessor system.