Oleg Zaikin

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 33

Top Topics

Monte Carlo Method

Collective Behavior

Top Venues

Publications

Oleg Zaikin
Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT Solvers. CP (2024)
Stepan Kochemazov, Oleg Zaikin
Towards Better SAT Encodings for Hash Function Inversion Problems. MIPRO (2024)
Oleg Zaikin
Inverting 43-step MD4 via Cube-and-Conquer. IJCAI (2022)
Oleg Zaikin
Inverting Cryptographic Hash Functions via Cube-and-Conquer. CoRR (2022)
Oleg Zaikin, Stepan Kochemazov
On black-box optimization in divide-and-conquer SAT solving. Optim. Methods Softw. 36 (4) (2021)
Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov, Victor Kondratiev
Speeding Up CDCL Inference with Duplicate Learnt Clauses. ECAI (2020)
Oleg Zaikin, Alexey Ignatiev, João Marques-Silva
Branch Location Problems with Maximum Satisfiability. ECAI (2020)
Alexander A. Semenov, Ilya V. Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems. Log. Methods Comput. Sci. 16 (1) (2020)
Stepan Kochemazov, Oleg Zaikin, Eduard Vatutin, Alexey Belyshev
Enumerating Diagonal Latin Squares of Order Up to 9. J. Integer Seq. 23 (1) (2020)
Oleg Zaikin, Stepan Kochemazov
Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box Functions. MOTOR (2020)
Oleg Zaikin, Ivan Derevitskii, Klavdiya Bochenina, Janusz A. Holyst
Optimizing Spatial Accessibility of Company Branches Network with Constraints. ICCS (2) (2019)
Oleg Zaikin, Stepan Kochemazov
Black-Box Optimization in an Extended Search Space for SAT Solving. MOTOR (2019)
Oleg Zaikin, Anton Petukhov, Klavdiya Bochenina
Bank Branch Network Optimization Based on Customers Geospatial Profiles. OTM Conferences (2019)
Artem Pavlenko, Alexander A. Semenov, Vladimir Ulyantsev, Oleg Zaikin
Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis. MIPRO (2019)
Oleg Zaikin
SAT-Based Cryptanalysis: From Parallel Computing to Volunteer Computing. RuSCDays (2019)
Stepan Kochemazov, Oleg Zaikin
ALIAS: A Modular Tool for Finding Backdoors for SAT. SAT (2018)
Eduard Vatutin, Alexey Belyshev, Stepan Kochemazov, Oleg Zaikin, Natalia Nikitina
Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing. RuSCDays (2018)
Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev
On Cryptographic Attacks Using Backdoors for SAT. CoRR (2018)
Alexander A. Semenov, Ilya V. Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems. CoRR (2018)
Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev
On Cryptographic Attacks Using Backdoors for SAT. AAAI (2018)
Oleg Zaikin, Stepan Kochemazov
An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator. ISC (2017)
Stepan Kochemazov, Eduard Vatutin, Oleg Zaikin
Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order. CoRR (2017)
Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov
Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10. MIPRO (2017)
Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov
Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior. MIPRO (2017)
Stepan Kochemazov, Alexander A. Semenov, Oleg Zaikin
The application of parameterized algorithms for solving SAT to the study of several discrete models of collective behavior. MIPRO (2016)
Alexander A. Semenov, Oleg Zaikin
On the Accuracy of Statistical Estimations of SAT Partitionings Effectiveness in Application to Discrete Function Inversion Problems. DOOR (Supplement) (2016)
Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
Encoding Cryptographic Functions to SAT Using Transalg System. CoRR (2016)
Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
Encoding Cryptographic Functions to SAT Using TRANSALG System. ECAI (2016)
Oleg Zaikin, Alexey Zhuravlev, Stepan Kochemazov, Eduard Vatutin
On the Construction of Triples of Diagonal Latin Squares of Order 10. Electron. Notes Discret. Math. 54 (2016)
Oleg Zaikin, Maxim Manzyuk, Stepan Kochemazov, Igor V. Bychkov, Alexander A. Semenov
A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters. NAA (2016)
Oleg Zaikin, Stepan Kochemazov, Alexander A. Semenov
SAT-based search for systems of diagonal latin squares in volunteer computing project SAT@home. MIPRO (2016)
Alexander A. Semenov, Oleg Zaikin
Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem. PaCT (2015)
Alexander A. Semenov, Oleg Zaikin
Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem. CoRR (2015)
Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov
Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks. CoRR (2014)
Alexander A. Semenov, Oleg Zaikin
On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project. CoRR (2013)
Mikhail Posypkin, Alexander A. Semenov, Oleg Zaikin
Using BOINC Desktop Grid to Solve Large Scale SAT Problems. Comput. Sci. 13 (1) (2012)
Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin
Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System. PaCT (2011)
Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin
Parallel algorithms for SAT in application to inversion problems of some discrete functions CoRR (2011)