Three variants of implementationof the meet-in-the-middle attack based on clusters and distributed computationsare considered for symmetric block cryptosystems. The average time of computationsis estimated on the universal supposition of cryptosystem key equiprobability. It is shownthat the reduction of the calculation time is proportional to the number of processors inthe system.
Download file
Counter downloads: 64
- Title On implementation of the meet-in-the-middle attack by means ofparallel computations
- Headline On implementation of the meet-in-the-middle attack by means ofparallel computations
- Publesher
Tomsk State University
- Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 3(13)
- Date:
- DOI
Keywords
метод согласования, кластер, распределенные вычисления, meet-in-the-middle attack, cluster computations, distributed computationsAuthors
References
Фомичёв В. М. Методы дискретной математики в криптологии. М.: ДИАЛОГ-МИФИ, 2010.
Шнайер Б. Прикладная криптография. Протоколы, алгоритмы, исходные тексты на языке Си. М.: ТРИУМФ, 2002.
Словарь криптографических терминов / под ред. Б. А. Погорелова и В.Н. Сачкова. М.: МЦНМО, 2006. 94 с.
Брассар Ж. Современная криптология: пер. с англ. М.: Полимед, 1999. 173 с.
ГрушоА.А., Тимонина Е. Е., Применко Э. А. Анализ и синтез криптоалгоритмов. Курс лекций. Йошкар-Ола: МФ МОСУ, 2000.

On implementation of the meet-in-the-middle attack by means ofparallel computations | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13).
Download full-text version
Download fileCounter downloads: 249