Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Semenov, Aleksandr Anatol'evich
Statistics Math-Net.Ru
Total publications: 46
Scientific articles: 46
Presentations: 2

Number of views:
This page:3831
Abstract pages:16145
Full texts:5144
References:1527
Associate professor
Candidate of technical sciences
E-mail: ,

https://www.mathnet.ru/eng/person28549
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/825092

Publications in Math-Net.Ru Citations
2024
1. K. V. Antonov, A. A. Semenov, I. V. Otpushchennikov, A. L. Pavlenko, “Constructing algebraic attacks on lightweight symmetric ciphers using functions with small number of output bits”, Prikl. Diskr. Mat. Suppl., 2024, no. 17,  57–63  mathnet
2023
2. A. A. Semenov, “The use of backdoors to estimate the hardness of propositional proofs and cryptographic attacks”, Prikl. Diskr. Mat. Suppl., 2023, no. 16,  87–95  mathnet
2022
3. A. A. Semenov, “Backdoors in combinatorial problems and their probabilistic generalizations”, Prikl. Diskr. Mat. Suppl., 2022, no. 15,  100–104  mathnet
2021
4. A. A. Semenov, K. V. Antonov, I. A. Gribanova, “Generating additional constraints in algebraic cryptanalysis using SAT oracles”, Prikl. Diskr. Mat. Suppl., 2021, no. 14,  104–110  mathnet
2020
5. I. A. Gribanova, A. A. Semenov, “Using inverse backdoors sets to construct guess-and-determine attacks on hash-functions MD4”, Prikl. Diskr. Mat. Suppl., 2020, no. 13,  124–129  mathnet
6. K. V. Antonov, A. A. Semenov, “Application of SAT oracles for generation of additional linear constraints in cryptanalysis of some lightweight ciphers”, Prikl. Diskr. Mat. Suppl., 2020, no. 13,  114–119  mathnet 1
2019
7. E. G. Beley, A. A. Semenov, “On propositional encoding of distinction property in finite sets”, Bulletin of Irkutsk State University. Series Mathematics, 28 (2019),  3–20  mathnet
8. A. A. Semenov, K. V. Antonov, I. V. Otpushchennikov, “Search for linearizing sets in algebraic cryptanalysis as a problem of pseudo-Boolean optimization”, Prikl. Diskr. Mat. Suppl., 2019, no. 12,  130–134  mathnet  elib 2
9. I. A. Gribanova, A. A. Semenov, “On the argument of the absence of properties of a random oracle for some cryptographic hash functions”, Prikl. Diskr. Mat. Suppl., 2019, no. 12,  95–98  mathnet  elib 2
10. V. S. Kondratiev, A. A. Semenov, O. S. Zaikin, “Duplicates of conflict clauses in CDCL derivation and their usage to invert some cryptographic functions”, Num. Meth. Prog., 20:1 (2019),  54–66  mathnet
2018
11. D. E. Gorbatenko, A. A. Semenov, “An effective algorithm for building a set of the shortest attacks within the context of one model of attack development in computer networks”, Prikl. Diskr. Mat. Suppl., 2018, no. 11,  90–95  mathnet  elib
12. A. A. Semenov, “Guess-and-determine attacks and automatic methods for their construction”, Prikl. Diskr. Mat. Suppl., 2018, no. 11,  81–86  mathnet  elib
13. I. V. Otpuschennikov, A. A. Semenov, O. S. Zaikin, “Propositional encoding of direct and inverse round transformations in attacks on some block ciphers”, Prikl. Diskr. Mat. Suppl., 2018, no. 11,  76–79  mathnet  elib
14. D. E. Gorbatenko, A. A. Semenov, “Counteraction to conspiracy in discrete dynamical models of computers network”, UBS, 75 (2018),  76–102  mathnet
2017
15. I. A. Gribanova, O. S. Zaikin, I. V. Otpushchennikov, A. A. Semenov, “Preimage attack on MD4 hash function as a problem of parallel sat-based cryptanalysis”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 6:3 (2017),  16–27  mathnet  elib 1
2016
16. A. A. Semenov, I. V. Otpuschennikov, “On one class of decision diagrams”, Avtomat. i Telemekh., 2016, no. 4,  84–98  mathnet  elib; Autom. Remote Control, 77:4 (2016), 617–628  isi  scopus 3
17. D. E. Gorbatenko, S. E. Kochemazov, A. A. Semenov, “On discrete automaton models of attacks in computer networks”, Prikl. Diskr. Mat. Suppl., 2016, no. 9,  80–83  mathnet 1
18. O. S. Zaikin, I. V. Otpuschennikov, A. A. Semenov, “Estimations of cryptographic resistance of ciphers in the Trivium family to SAT-based cryptanalysis”, Prikl. Diskr. Mat. Suppl., 2016, no. 9,  46–48  mathnet 1
2015
19. I. A. Bogachkova, O. S. Zaikin, S. E. Kochemazov, I. V. Otpuschennikov, A. A. Semenov, “Application of algorithms solving SAT problem to cryptanalysis of hash functions of MD family”, Prikl. Diskr. Mat. Suppl., 2015, no. 8,  139–142  mathnet 2
20. I. A. Bogachkova, O. S. Zaikin, S. E. Kochemazov, I. V. Otpushchennikov, A. A. Semenov, O. O. Khamisov, “Problems of search for collisions of cryptographic hash functions of the MD family as variants of Boolean satisfiability problem”, Num. Meth. Prog., 16:1 (2015),  61–77  mathnet 2
2014
21. A. A. Evdokimov, S. E. Kochemazov, I. V. Otpushennikov, A. A. Semenov, “Analysis of discrete automaton models of gene networks with irregular structure using symbolic algorithms”, Diskretn. Anal. Issled. Oper., 21:3 (2014),  25–40  mathnet; J. Appl. Industr. Math., 8:3 (2014), 307–316 3
22. O. S. Zaikin, A. A. Semenov, “Application of the Monte Carlo method for estimating the total time of solving the SAT problem in parallel”, Num. Meth. Prog., 15:1 (2014),  22–35  mathnet 4
2013
23. A. A. Semenov, “On the effective representation of disjunctive normal forms by diagrams of a special kind”, Prikl. Diskr. Mat. Suppl., 2013, no. 6,  125–129  mathnet
24. V. G. Bulavintsev, A. A. Semenov, “GPU-based implementation of DPLL algorithm with limited non-chronological backtracking”, Prikl. Diskr. Mat. Suppl., 2013, no. 6,  111–112  mathnet
25. A. A. Evdokimov, S. E. Kochemazov, I. V. Otpushennikov, A. A. Semenov, “Dynamical properties of some discrete automaton mappings defined by random graphs”, Prikl. Diskr. Mat. Suppl., 2013, no. 6,  75–76  mathnet
26. A. A. Semenov, S. E. Kochemazov, “Analysis of some discrete-automaton models of collective behavior”, UBS, 46 (2013),  266–292  mathnet 1
27. O. S. Zaikin, A. A. Semenov, M. A. Posypkin, “Constructing decomposition sets for distributed solution of sat problems in volunteer computing project sat@home”, UBS, 43 (2013),  138–156  mathnet 4
2012
28. A. A. Semenov, O. S. Zaikin, “Algorithms for constructing decomposition sets in application to coarse-grained parallelization of SAT problems”, Bulletin of Irkutsk State University. Series Mathematics, 5:4 (2012),  79–94  mathnet
29. A. A. Semenov, A. S. Ignatiev, “About convergence of a hybrid SAT+ROBDD-derivation”, Prikl. Diskr. Mat. Suppl., 2012, no. 5,  118–120  mathnet
30. O. S. Zaikin, M. A. Posypkin, A. A. Semenov, “Using volunteer computation to solve cryptographic problems”, Prikl. Diskr. Mat. Suppl., 2012, no. 5,  107–108  mathnet
2011
31. I. V. Otpuschennikov, A. A. Semenov, “Transformations of discrete functions calculation algorithms to boolean equations”, Bulletin of Irkutsk State University. Series Mathematics, 4:1 (2011),  83–96  mathnet
32. A. A. Semenov, I. V. Otpuschennikov, S. E. Kochemazov, “Application of SAT-approach for solving combinatorial problems”, Prikl. Diskr. Mat., 2011, no. supplement № 4,  68–69  mathnet
33. I. V. Otpuschennikov, A. A. Semenov, “Technology for translating combinatorial problems into Boolean equations”, Prikl. Diskr. Mat., 2011, no. 1(11),  96–115  mathnet 16
34. O. S. Zaikin, I. V. Otpushchennikov, A. A. Semenov, “Parallel algorithms for solving SAT-problems in application to optimization problems with Boolean constraints”, Num. Meth. Prog., 12:1 (2011),  205–212  mathnet
2010
35. D. V. Bespalov, V. G. Bulavintsev, A. A. Semenov, “Cryptanalysis with graphical processing units (GPU)”, Prikl. Diskr. Mat., 2010, no. supplement № 3,  86–87  mathnet 1
36. I. V. Otpuschennikov, A. A. Semenov, “Software translating of combinatorial problems to propositional logic”, Prikl. Diskr. Mat., 2010, no. supplement № 3,  81–82  mathnet
37. A. S. Ignatiev, A. A. Semenov, “Algorithms using ROBDD as a base for Boolean constraints”, Prikl. Diskr. Mat., 2010, no. 1(7),  86–104  mathnet 1
2009
38. A. S. Ignat'ev, A. A. Semenov, D. V. Bespalov, O. S. Zaikin, “A hybrid approach (SAT+ROBDD) to cryptanalysis of stream encryption systems”, Prikl. Diskr. Mat., 2009, no. supplement № 1,  19–20  mathnet
39. A. A. Semenov, “About tseitin's transformation in logical equations”, Prikl. Diskr. Mat., 2009, no. supplement № 1,  12–13  mathnet 1
40. A. A. Semenov, “About Tseitin transformation in logical equations”, Prikl. Diskr. Mat., 2009, no. 4(6),  28–50  mathnet 3
2008
41. A. A. Semenov, O. S. Zaikin, D. V. Bespalov, P. S. Burov, A. E. Hmelnov, “Analysis of some cryptographic primitives on computer clusters”, Prikl. Diskr. Mat., 2008, no. 2(2),  120–130  mathnet
42. O. S. Zaikin, A. A. Semenov, “Large-block parallelism technology in sat problems”, Probl. Upr., 2008, no. 1,  43–50  mathnet 14
43. A. A. Semenov, O. S. Zaikin, “Incomplete algorithms in the large-block parallelism of combinatorial problems”, Num. Meth. Prog., 9:1 (2008),  108–118  mathnet 3
2004
44. A. A. Semenov, “On the complexity of the inversion of discrete functions of a certain class”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004),  44–55  mathnet  mathscinet 4
1999
45. B. V. Egorov, V. N. Komarov, Yu. E. Markachev, A. P. Markelov, E. A. Plekhanov, A. A. Semenov, V. L. Yumashev, “Clusterization of aviation fuel combustion products in jet behind supersonic aircraft”, Matem. Mod., 11:4 (1999),  70–82  mathnet
1988
46. S. A. Lozhkin, A. A. Semenov, “On a method for compressing information and on the complexity of the realization of monotone symmetric functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 7,  44–52  mathnet  mathscinet  zmath; Soviet Math. (Iz. VUZ), 32:7 (1988), 73–85 3

Presentations in Math-Net.Ru
1. Using Backdoors to estimate the hardness of Boolean formulas w.r.t. SAT solving algorithms
A. A. Semenov, S. E. Kochemazov
Second Conference of Russian Mathematical Centers. Section «Mathematical Logic and Theoretical Computer Science»
November 8, 2022 15:45   
2. Applying Metaheuristic Pseudo-Boolean Optimization Algorithms to Search for Linearizing Sets in Cryptanalysis of Cryptographic Generators
K. V. Antonov, A. A. Semenov
International workshop "Syntax and semantics of logical systems"
August 12, 2019 12:30

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024