Страница публикации

SAT-based cryptanalysis: from parallel computing to volunteer computing

Тип публикации: Статья в журнале

Тип материала: Текст

Авторы: Zaikin O.

Журнал: Communication in Computer and Information Science: Proc. Intern. Conf. Russian supercomputing days 2019 (Moscow, Russia; September 23-24, 2019)

Язык публикации: english

Серия книг: Communication in Computer and Information Science

Том: 1129

Номера страниц: 1-12

Количество страниц: 12

Год публикации: 2019

Отчетный год: 2020

DOI: 10.1007/978-3-030-36592-9_57

Аннотация: Volunteer computing is a powerful tool for solving hard problems by the divide-and-conquer approach. During the last decade, several hard cryptanalysis problems were solved in the volunteer computing project SAT@home. In this study, the preliminary stage of these experiments are described: how SAT-based cryptanalysis problems are chosen; how these problems are studied on a computing cluster using state-of-the-art multithreaded SAT solvers; how decompositions of the chosen SAT problems are constructed using a Monte Carlo method; how server and client software are prepared for the corresponding experiments in SAT@home. These issues are described in application to several stream ciphers, for which it is planned to launch experiments in SAT@home.

Индексируется WOS: Q5

Индексируется Scopus: Нет

Индексируется УБС: Нет

Индексируется РИНЦ: Нет

Индексируется ВАК: Нет

Индексируется CORE: Нет