On parallel computations in implementation of the meat-in-the-middle attack
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 69-73
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
[1] Brassar Zh., Sovremennaya kriptologiya, per. s angl., Polimed, M., 1999
[2] Grusho A. A., Timonina E. E., Primenko E. A., Analiz i sintez kriptoalgoritmov, Kurs lektsii, MF MOSU, Ioshkar-Ola, 2000
[3] Fomichëv V. M., Metody diskretnoi matematiki v kriptologii, DIALOG-MIFI, M., 2010
[4] Shnaier B., Prikladnaya kriptografiya. Protokoly, algoritmy, iskhodnye teksty na yazyke Si, TRIUMF, M., 2002
[5] Fomichëv V. M., “O realizatsii metoda soglasovaniya v kriptoanalize s pomoschyu parallelnykh vychislenii”, Prikladnaya diskretnaya matematika, 2011 (to appear)