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

Exploring the Limits of Problem-Specific Adaptations of SAT Solvers in SAT-Based Cryptanalysis

Авторы: Kochemazov S.

Журнал: Communications in Computer and Information Science: 15th Intern. Conf. on Parallel Computational Technologies PCT 2021 (30 March 2021 - 1 April 2021)

Том: 1437

Номер:

Год: 2021

Отчётный год: 2021

Издательство:

Местоположение издательства:

URL:

Проекты:

DOI: 10.1007/978-3-030-81691-9_11

Аннотация: SAT-based cryptanalysis implies using algorithms for solving the Boolean Satisfiability (SAT) problem to perform cryptographic attacks. It is a flourishing research field. Tackling individual subproblems constructed in the course of the so-called guess-and-determine attacks is the most straightforward way SAT solvers are used in cryptography. If the expected runtime of an attack is of the order of millions of hours, then it makes sense to try to squeeze any extra bit of performance out of the main algorithm. In this paper, our goal is to figure out possible ways to do exactly that with SAT solvers, going beyond simple parameter tuning. In particular, we consider tasks related to cryptanalysis of several modern keystream generators, analyze and prepare several modifications of state-of-the-art SAT solvers to tackling them, tune their parameters, and evaluate the speedup.

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

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

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

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

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

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

Публикация в печати: 0