On implementation of the meet-in-the-middle attack by means of parallel computations

Three variants of implementation of the meet-in-the-middle attack based on clusters and distributed computations are considered for symmetric block cryptosystems. The average time of computations is estimated on the universal supposition of cryptosystem key equiprobability. It is shown that the reduction of the calculation time is proportional to the number of processors in the system.