Using Constraint Solvers to Construct Binary Codes with Good Error Correction Performance.

Oleg Zaikin 0002 Swansea University, UK Russian Academy of Sciences, Siberian Branch, Matrosov Institute for System Dynamics and Control Theory, Irkutsk, Russia https://scholar.google.com/citations?user=pE3Rl5EAAAAJ https://orcid.org/0000-0002-0145-5010 https://www.wikidata.org/entity/Q89220926 https://www.researcherid.com/rid/F-1007-2017 https://www.scopus.com/authid/detail.uri?authorId=56786079600 Oleg Zaikin Oleg Zaikin 0001 Oleg A. Zaikin Warsaw School of Computer Science, Poland Szczecin University of Technology, Faculty of Computer Science and Information Technology, Poland https://www.scopus.com/authid/detail.uri?authorId=6507550598 Stepan Kochemazov Oleg Zaikin 0002 Grigorii Trofimiuk Kirill Antonov Alexander A. Semenov Using Constraint Solvers to Construct Binary Codes with Good Error Correction Performance. 14278-14286 2026 AAAI https://doi.org/10.1609/aaai.v40i17.38442 conf/aaai/2026 db/conf/aaai/aaai2026.html#KochemazovZTAS26

Oleg Zaikin 0002 Inverting Cryptographic Hash Functions via Cube-and-Conquer. 359-399 2024 81 J. Artif. Intell. Res. https://doi.org/10.1613/jair.1.15244 https://www.wikidata.org/entity/Q130992837 db/journals/jair/jair81.html#Zaikin24 streams/journals/jair

Oleg Zaikin 0002 Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT Solvers. 31:1-31:19 2024 CP https://doi.org/10.4230/LIPIcs.CP.2024.31 conf/cp/2024 db/conf/cp/cp2024.html#000224 Stepan Kochemazov Oleg Zaikin 0002 Towards Better SAT Encodings for Hash Function Inversion Problems. 25-30 2024 MIPRO https://doi.org/10.1109/MIPRO60963.2024.10569193 conf/mipro/2024 db/conf/mipro/mipro2024.html#Kochemazov024 Oleg Zaikin 0002 Inverting 43-step MD4 via Cube-and-Conquer. 1894-1900 2022 IJCAI https://doi.org/10.24963/ijcai.2022/263 conf/ijcai/2022 db/conf/ijcai/ijcai2022.html#000322

Oleg Zaikin 0002 Inverting Cryptographic Hash Functions via Cube-and-Conquer. 2022 abs/2212.02405 CoRR https://doi.org/10.48550/arXiv.2212.02405 db/journals/corr/corr2212.html#abs-2212-02405

Oleg Zaikin 0002 Stepan Kochemazov On black-box optimization in divide-and-conquer SAT solving. 672-696 2021 36 Optim. Methods Softw. 4 https://doi.org/10.1080/10556788.2019.1685993 db/journals/oms/oms36.html#ZaikinK21

Oliver Kullmann Oleg Zaikin 0002 Projection Heuristics for Binary Branchings Between Sum and Product. 299-314 2021 SAT https://doi.org/10.1007/978-3-030-80223-3_21 conf/sat/2021 db/conf/sat/sat2021.html#KullmannZ21

Stepan Kochemazov Oleg Zaikin 0002 Eduard Vatutin Alexey Belyshev Enumerating Diagonal Latin Squares of Order Up to 9. 20.1.2 2020 23 J. Integer Seq. 1 https://cs.uwaterloo.ca/journals/JIS/VOL23/Zaikin/zaikin3.html db/journals/jintseq/jintseq23.html#KochemazovZVB20

Alexander A. Semenov Ilya V. Otpuschennikov Irina Gribanova Oleg Zaikin 0002 Stepan Kochemazov Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems. 2020 16 Log. Methods Comput. Sci. 1 https://doi.org/10.23638/LMCS-16(1:29)2020 db/journals/lmcs/lmcs16.html#SemenovOG0K19

Stepan Kochemazov Oleg Zaikin 0002 Alexander A. Semenov Victor Kondratiev Speeding Up CDCL Inference with Duplicate Learnt Clauses. 339-346 2020 ECAI https://doi.org/10.3233/FAIA200111 conf/ecai/2020 db/conf/ecai/ecai2020.html#Kochemazov0SK20 Oleg Zaikin 0002 Alexey Ignatiev João Marques-Silva 0001 Branch Location Problems with Maximum Satisfiability. 379-386 2020 ECAI https://doi.org/10.3233/FAIA200116 conf/ecai/2020 db/conf/ecai/ecai2020.html#0002I020 Oleg Zaikin 0002 Stepan Kochemazov Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box Functions. 373-388 2020 MOTOR https://doi.org/10.1007/978-3-030-49988-4_26 conf/motor/2020 db/conf/motor/motor2020.html#0002K20 Oleg Zaikin 0002 Ivan Derevitskii Klavdiya Bochenina Janusz A. Holyst Optimizing Spatial Accessibility of Company Branches Network with Constraints. 332-345 2019 ICCS (2) https://doi.org/10.1007/978-3-030-22741-8_24 conf/iccS/2019-2 db/conf/iccS/iccS2019-2.html#ZaikinDBH19 Artem Pavlenko Alexander A. Semenov Vladimir Ulyantsev Oleg Zaikin 0002 Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis. 1144-1149 2019 MIPRO https://doi.org/10.23919/MIPRO.2019.8757214 conf/mipro/2019 db/conf/mipro/mipro2019.html#PavlenkoSUZ19 Oleg Zaikin 0002 Stepan Kochemazov Black-Box Optimization in an Extended Search Space for SAT Solving. 402-417 2019 MOTOR https://doi.org/10.1007/978-3-030-22629-9_28 conf/motor/2019 db/conf/motor/motor2019.html#0002K19 Oleg Zaikin 0002 Anton Petukhov Klavdiya Bochenina Bank Branch Network Optimization Based on Customers Geospatial Profiles. 201-208 2019 OTM Conferences https://doi.org/10.1007/978-3-030-33246-4_13 conf/otm/2019 db/conf/otm/otm2019.html#0002PB19 Oleg Zaikin 0002 SAT-Based Cryptanalysis: From Parallel Computing to Volunteer Computing. 701-712 2019 RuSCDays https://doi.org/10.1007/978-3-030-36592-9_57 conf/ruscdays/2019 db/conf/ruscdays/ruscdays2019.html#Zaikin19 Alexander A. Semenov Oleg Zaikin 0002 Ilya V. Otpuschennikov Stepan Kochemazov Alexey Ignatiev On Cryptographic Attacks Using Backdoors for SAT. 2018 AAAI https://doi.org/10.1609/aaai.v32i1.12205 conf/aaai/2018 db/conf/aaai/aaai2018.html#SemenovZOKI18 6641-6648 Eduard Vatutin Alexey Belyshev Stepan Kochemazov Oleg Zaikin 0002 Natalia Nikitina Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing. 578-586 2018 RuSCDays https://doi.org/10.1007/978-3-030-05807-4_49 conf/ruscdays/2018 db/conf/ruscdays/ruscdays2018.html#VatutinBK0N18 Stepan Kochemazov Oleg Zaikin 0002 ALIAS: A Modular Tool for Finding Backdoors for SAT. 419-427 2018 SAT https://doi.org/10.1007/978-3-319-94144-8_25 conf/sat/2018 db/conf/sat/sat2018.html#KochemazovZ18

Alexander A. Semenov Oleg Zaikin 0002 Ilya V. Otpuschennikov Stepan Kochemazov Alexey Ignatiev On Cryptographic Attacks Using Backdoors for SAT. 2018 abs/1803.04646 CoRR http://arxiv.org/abs/1803.04646 db/journals/corr/corr1803.html#abs-1803-04646

Alexander A. Semenov Ilya V. Otpuschennikov Irina Gribanova Oleg Zaikin 0002 Stepan Kochemazov Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems. 2018 abs/1805.07239 CoRR http://arxiv.org/abs/1805.07239 db/journals/corr/corr1805.html#abs-1805-07239

Oleg Zaikin 0002 Stepan Kochemazov An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator. 21-38 2017 ISC https://doi.org/10.1007/978-3-319-69659-1_2 conf/isw/2017 db/conf/isw/isc2017.html#ZaikinK17 Stepan Kochemazov Oleg Zaikin 0002 Alexander A. Semenov Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10. 1166-1171 2017 MIPRO https://doi.org/10.23919/MIPRO.2017.7973600 https://www.wikidata.org/entity/Q60692746 conf/mipro/2017 db/conf/mipro/mipro2017.html#KochemazovZS17 Stepan Kochemazov Oleg Zaikin 0002 Alexander A. Semenov Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior. 1172-1177 2017 MIPRO https://doi.org/10.23919/MIPRO.2017.7973601 conf/mipro/2017 db/conf/mipro/mipro2017.html#KochemazovZS17a

Stepan Kochemazov Eduard Vatutin Oleg Zaikin 0002 Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order. 2017 abs/1709.02599 CoRR http://arxiv.org/abs/1709.02599 db/journals/corr/corr1709.html#abs-1709-02599

Oleg Zaikin 0002 Alexey Zhuravlev Stepan Kochemazov Eduard Vatutin On the Construction of Triples of Diagonal Latin Squares of Order 10. 307-312 2016 54 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2016.09.053 db/journals/endm/endm54.html#ZaikinZKV16

Alexander A. Semenov Oleg Zaikin 0002 On the Accuracy of Statistical Estimations of SAT Partitionings Effectiveness in Application to Discrete Function Inversion Problems. 261-275 2016 DOOR (Supplement) https://ceur-ws.org/Vol-1623/papermp12.pdf conf/door/2016s db/conf/door/door2016s.html#SemenovZ16 Ilya V. Otpuschennikov Alexander A. Semenov Irina Gribanova Oleg Zaikin 0002 Stepan Kochemazov Encoding Cryptographic Functions to SAT Using TRANSALG System. 1594-1595 2016 ECAI https://doi.org/10.3233/978-1-61499-672-9-1594 conf/ecai/2016 db/conf/ecai/ecai2016.html#OtpuschennikovS16 Oleg Zaikin 0002 Stepan Kochemazov Alexander A. Semenov SAT-based search for systems of diagonal latin squares in volunteer computing project SAT@home. 277-281 2016 MIPRO https://doi.org/10.1109/MIPRO.2016.7522152 conf/mipro/2016 db/conf/mipro/mipro2016.html#ZaikinKS16 Stepan Kochemazov Alexander A. Semenov Oleg Zaikin 0002 The application of parameterized algorithms for solving SAT to the study of several discrete models of collective behavior. 1288-1292 2016 MIPRO https://doi.org/10.1109/MIPRO.2016.7522338 conf/mipro/2016 db/conf/mipro/mipro2016.html#KochemazovSZ16 Oleg Zaikin 0002 Maxim Manzyuk Stepan Kochemazov Igor V. Bychkov Alexander A. Semenov A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters. 769-776 2016 NAA https://doi.org/10.1007/978-3-319-57099-0_89 conf/naa/2016 db/conf/naa/naa2016.html#ZaikinMKBS16

Ilya V. Otpuschennikov Alexander A. Semenov Irina Gribanova Oleg Zaikin 0002 Stepan Kochemazov Encoding Cryptographic Functions to SAT Using Transalg System. 2016 abs/1607.00888 CoRR http://arxiv.org/abs/1607.00888 db/journals/corr/corr1607.html#OtpuschennikovS16

Alexander A. Semenov Oleg Zaikin 0002 Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem. 222-230 2015 PaCT https://doi.org/10.1007/978-3-319-21909-7_21 conf/pact/2015 db/conf/pact/pact2015.html#SemenovZ15

Alexander A. Semenov Oleg Zaikin 0002 Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem. 2015 abs/1507.00862 CoRR http://arxiv.org/abs/1507.00862 db/journals/corr/corr1507.html#SemenovZ15

Alexander A. Semenov Oleg Zaikin 0002 Ilya V. Otpuschennikov Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks. 2014 abs/1411.5433 CoRR http://arxiv.org/abs/1411.5433 db/journals/corr/corr1411.html#SemenovZO14

Alexander A. Semenov Oleg Zaikin 0002 On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project. 2013 CoRR http://arxiv.org/abs/1308.0761 abs/1308.0761 db/journals/corr/corr1308.html#SemenovZ13

Mikhail Posypkin Alexander A. Semenov Oleg Zaikin 0002 Using BOINC Desktop Grid to Solve Large Scale SAT Problems. 25-34 2012 13 Comput. Sci. 1 https://doi.org/10.7494/csci.2012.13.1.25 https://www.wikidata.org/entity/Q73606082 db/journals/aghcs/aghcs13.html#PosypkinSZ12

Alexander A. Semenov Oleg Zaikin 0002 Dmitry Bespalov Mikhail Posypkin Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System. 473-483 2011 PaCT https://doi.org/10.1007/978-3-642-23178-0_43 conf/pact/2011 db/conf/pact/pact2011.html#SemenovZBP11

Alexander A. Semenov Oleg Zaikin 0002 Dmitry Bespalov Mikhail Posypkin Parallel algorithms for SAT in application to inversion problems of some discrete functions http://arxiv.org/abs/1102.3563 2011 CoRR abs/1102.3563 db/journals/corr/corr1102.html#abs-1102-3563

Kirill Antonov Alexey Belyshev Dmitry Bespalov Klavdiya Bochenina Igor V. Bychkov Ivan Derevitskii Irina Gribanova Janusz A. Holyst Alexey Ignatiev Stepan Kochemazov Victor Kondratiev Oliver Kullmann Maxim Manzyuk João Marques-Silva 0001 Natalia Nikitina Ilya V. Otpuschennikov Artem Pavlenko Anton Petukhov Mikhail Posypkin Alexander A. Semenov Grigorii Trofimiuk Vladimir I. UlyantsevVladimir Ulyantsev Eduard Vatutin Alexey Zhuravlev