Oleg Zaikin
Cited by
Cited by
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
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
Using BOINC desktop grid to solve large scale SAT problems
M Posypkin, A Semenov, O Zaikin
Computer Science 13, 25-34, 2012
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
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
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
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
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
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
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
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
Transalg: a tool for translating procedural descriptions of discrete functions to SAT
I Otpuschennikov, A Semenov, S Kochemazov
arXiv preprint arXiv:1405.1544, 2014
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
An improved SAT-based guess-and-determine attack on the alternating step generator
O Zaikin, S Kochemazov
International Conference on Information Security, 21-38, 2017
MapleLCMDistChronoBT-DL, duplicate learnts heuristic-aided solvers at the SAT Race 2019
S Kochemazov, O Zaikin, V Kondratiev, A Semenov
SAT RACE 2019, 24, 2019
Applying volunteer and parallel computing for enumerating diagonal latin squares of order 9
EI Vatutin, SE Kochemazov, OS Zaikin
International Conference on Parallel Computational Technologies, 114-129, 2017
Enumerating the Transversals for Diagonal Latin Squares of Small Order
EI Vatutin, SE Kochemazov, OS Zaikin, SY Valyaev
CEUR Workshop Proceedings. Proceedings of the Third International Conference …, 2017
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
SK Alexander Semenov, Ilya Otpuschennikov, Irina Gribanova, Oleg Zaikin
Logical methods in computer science 16 (1), 2020
Enumeration of isotopy classes of diagonal Latin squares of small order using volunteer computing
E Vatutin, A Belyshev, S Kochemazov, O Zaikin, N Nikitina
Russian Supercomputing Days, 578-586, 2018
ALIAS: A modular tool for finding backdoors for SAT
S Kochemazov, O Zaikin
International Conference on Theory and Applications of Satisfiability …, 2018
The system can't perform the operation now. Try again later.
Articles 1–20