On implementation of the meet-in-the-middle attack by means of parallel computations
Prikladnaâ diskretnaâ matematika, no. 3 (2011), pp. 116-121
Cet article a éte moissonné depuis la source Math-Net.Ru
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.
Keywords:
meet-in-the-middle attack, cluster computations, distributed computations.
@article{PDM_2011_3_a8,
author = {V. M. Fomichev},
title = {On implementation of the meet-in-the-middle attack by means of parallel computations},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {116--121},
year = {2011},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2011_3_a8/}
}
V. M. Fomichev. On implementation of the meet-in-the-middle attack by means of parallel computations. Prikladnaâ diskretnaâ matematika, no. 3 (2011), pp. 116-121. http://geodesic.mathdoc.fr/item/PDM_2011_3_a8/
[1] Fomichëv V. M., Metody diskretnoi matematiki v kriptologii, DIALOG-MIFI, M., 2010
[2] Shnaier B., Prikladnaya kriptografiya. Protokoly, algoritmy, iskhodnye teksty na yazyke Si, TRIUMF, M., 2002
[3] B. A. Pogorelov, V. N. Sachkov (red.), Slovar kriptograficheskikh terminov, MTsNMO, M., 2006, 94 pp.
[4] Brassar Zh., Sovremennaya kriptologiya, per. s angl., Polimed, M., 1999, 173 pp.
[5] Grusho A. A., Timonina E. E., Primenko E. A., Analiz i sintez kriptoalgoritmov, Kurs lektsii, MF MOSU, Ioshkar-Ola, 2000