Oleg Zaikin
Title
Cited by
Cited by
Year
Parallel logical cryptanalysis of the generator A5/1 in BNB-Grid system
A Semenov, O Zaikin, D Bespalov, M Posypkin
International Conference on Parallel Computing Technologies, 473-483, 2011
542011
Encoding cryptographic functions to SAT using Transalg system
I Otpuschennikov, A Semenov, I Gribanova, O Zaikin, S Kochemazov
Proceedings of the Twenty-second European Conference on Artificial …, 2016
482016
Using BOINC desktop grid to solve large scale SAT problems
M Posypkin, A Semenov, O Zaikin
Computer Science 13, 25-34, 2012
462012
Experience in organizing volunteer computing: a case study of the OPTIMA@home and SAT@home projects
OS Zaikin, MA Posypkin, AA Semenov, NP Khrapov
Vestnik of Lobachevsky State University of Nizhni Novgorod, 340-347, 2012
42*2012
Технология крулооблочного параллеллзма в SAT-задачах
ОС Заикин, АА Семенов
Проблемы управления, 2008
42*2008
Решение задач криптоанализа поточных шифров в распределенных вычислительных средах
ААС М А Посыпкин, О С Заикин, Д В Беспалов
Труды Института системного анализа РАН 46, 119-137, 2009
35*2009
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
A Semenov, O Zaikin
SpringerPlus 5 (1), 1-16, 2016
302016
Процедуры построения декомпозиционных множеств для распределенного решения SAT-задач в проекте добровольных вычислений SAT@ home
ОС Заикин, АА Семёнов, МА Посыпкин
Управление большими системами: сборник трудов, 2013
28*2013
Technology for integrating idle computing cluster resources into volunteer computing projects
AP Afanasiev, IV Bychkov, MO Manzyuk, MA Posypkin, AA Semenov, ...
Proc. of The 5th International Workshop on Computer Science and Engineering …, 2015
27*2015
Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
A Semenov, O Zaikin
International Conference on Parallel Computing Technologies, 222-230, 2015
252015
On cryptographic attacks using backdoors for SAT
A Semenov, O Zaikin, I Otpuschennikov, S Kochemazov, A Ignatiev
Thirty-Second AAAI Conference on Artificial Intelligence, 2018
242018
On the construction of triples of diagonal Latin squares of order 10
O Zaikin, A Zhuravlev, S Kochemazov, E Vatutin
Electronic Notes in Discrete Mathematics 54, 307-312, 2016
242016
SAT-подход в криптоанализе некоторых систем поточного шифрования
АА Семенов, ОС Заикин, ДВ Беспалов, АА Ушаков
Вычислительные технологии 13 (6), 2008
21*2008
Concept of a multitask grid system with a flexible allocation of idle computational resources of supercomputers
AP Afanasiev, IV Bychkov, OS Zaikin, MO Manzyuk, MA Posypkin, ...
Journal of Computer and Systems Sciences International 56 (4), 701-707, 2017
20*2017
SAT-based search for systems of diagonal Latin squares in volunteer computing project SAT@ home
O Zaikin, S Kochemazov, A Semenov
2016 39th International Convention on Information and Communication …, 2016
202016
The search for systems of diagonal Latin squares using the SAT@home project
O Zaikin, S Kochemazov
International Journal of Open Information Technologies 3 (11), 4-9, 2015
192015
Transalg: a tool for translating procedural descriptions of discrete functions to SAT
I Otpuschennikov, A Semenov, S Kochemazov
arXiv preprint arXiv:1405.1544, 2014
192014
Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares
EI Vatutin, O Zaikin, A Zhuravlev, M Manzyuk, S Kochemazov, VS Titov
Selected Papers of the 7th International Conference Distributed Computing …, 2016
182016
Применение метода Монте-Карло к прогнозированию времени параллельного решения проблемы булевой выполнимости
ОС Заикин, АА Семёнов
Вычислительные методы и программирование 15 (1), 22-35, 2014
17*2014
Solving discrete functions inversion problems on multiprocessor computing systems
A Semenov, O Zaikin, D Bespalov, P Burov, A Hmelnov
Proceedings on Parallel computing and Control Problems (PACO’2008), Moscow …, 2008
17*2008
The system can't perform the operation now. Try again later.
Articles 1–20