Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis. - Artem Pavlenko; Alexander A. Semenov; Vladimir Ulyantsev (EvoApplications, 2019)

Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks. - Artem Pavlenko; Maxim Buzdalov 001; Vladimir Ulyantsev (GECCO, 2019)

Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis. - Artem Pavlenko; Alexander A. Semenov; Vladimir Ulyantsev; Oleg Zaikin 002 (MIPRO, 2019)

Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. - Alexander A. Semenov; Daniil Chivilikhin; Artem Pavlenko; Ilya V. Otpuschennikov; Vladimir Ulyantsev; Alexey Ignatiev (CP, 2021)

On Probabilistic Generalization of Backdoors in Boolean Satisfiability. - Alexander A. Semenov; Artem Pavlenko; Daniil Chivilikhin; Stepan Kochemazov (AAAI, 2022)

Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability. - Artem Pavlenko; Daniil Chivilikhin; Alexander A. Semenov (CEC, 2022)

Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis. - Alexander A. Semenov; Kirill Antonov; Stepan Kochemazov; Artem Pavlenko (IEEE Access, 2023)

Decomposing Hard SAT Instances with Metaheuristic Optimization. - Daniil Chivilikhin; Artem Pavlenko; Alexander A. Semenov (CoRR, 2023)

Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT. - Artem Pavlenko; Alexander A. Semenov (CEC, 2024)