Citations

EvoGuess Citations

MIPRO2019: Pavlenko A., Semenov A., Ulyantsev V., Zaikin O.: Parallel framework for evolutionary black-box optimization with application to algebraic cryptanalysis / 42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE 2019, pp. 1144-1149. https://doi.org/10.23919/MIPRO.2019.8757214

AAAI2018: Semenov, A., Zaikin, O., Otpuschennikov, I., Kochemazov, S., Ignatiev, A.: On Cryptographic Attacks Using Backdoors for SAT. AAAI 2018, pp. 6641-6648. https://arxiv.org/abs/1803.04646
AAAI2022: Semenov, A., Pavlenko, A., Chivilikhin, D., Kochemazov, S.: On Probabilistic Generalization of Backdoors in Boolean Satisfiability. AAAI 2022. https://www.aaai.org/AAAI22Papers/AAAI-8477.SemenovA.pdf

EVO2019: Pavlenko A., Semenov A., Ulyantsev V. Evolutionary Computation Techniques for Constructing SAT-based Attacks in Algebraic Cryptanalysis / International Conference on the Applications of Evolutionary Computation (Part of EvoStar). Springer 2019, pp. 237–253. https://doi.org/10.1007/978-3-030-16692-2_16
GECCO2019: Pavlenko A., Buzdalov M., Ulyantsev V. Fitness Comparison by Statistical Testing in Construction of SAT-Based Guess-and-Determine Cryptographic Attacks / Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2019), pp. 312–320. https://doi.org/10.1145/3321707.3321847
CP2021: Semenov A., Chivilikhin D., Pavlenko A., Otpuschennikov I., Ulyantsev V.I., Ignatiev A.: Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms / 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), vol. 210, pp. 47:1-47:18. https://drops.dagstuhl.de/opus/volltexte/2021/15338
CEC2022: Pavlenko A., Chivilikhin D., Semenov A. Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability / 2022 IEEE Congress on Evolutionary Computation (CEC). IEEE 2022, pp. 1-8.