RUS  ENG
Full version
PEOPLE

Semenov Aleksandr Anatol'evich

Publications in Math-Net.Ru

  1. Constructing algebraic attacks on lightweight symmetric ciphers using functions with small number of output bits

    Prikl. Diskr. Mat. Suppl., 2024, no. 17,  57–63
  2. The use of backdoors to estimate the hardness of propositional proofs and cryptographic attacks

    Prikl. Diskr. Mat. Suppl., 2023, no. 16,  87–95
  3. Backdoors in combinatorial problems and their probabilistic generalizations

    Prikl. Diskr. Mat. Suppl., 2022, no. 15,  100–104
  4. Generating additional constraints in algebraic cryptanalysis using SAT oracles

    Prikl. Diskr. Mat. Suppl., 2021, no. 14,  104–110
  5. Using inverse backdoors sets to construct guess-and-determine attacks on hash-functions MD4

    Prikl. Diskr. Mat. Suppl., 2020, no. 13,  124–129
  6. 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
  7. On propositional encoding of distinction property in finite sets

    Bulletin of Irkutsk State University. Series Mathematics, 28 (2019),  3–20
  8. Search for linearizing sets in algebraic cryptanalysis as a problem of pseudo-Boolean optimization

    Prikl. Diskr. Mat. Suppl., 2019, no. 12,  130–134
  9. 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
  10. Duplicates of conflict clauses in CDCL derivation and their usage to invert some cryptographic functions

    Num. Meth. Prog., 20:1 (2019),  54–66
  11. 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
  12. Guess-and-determine attacks and automatic methods for their construction

    Prikl. Diskr. Mat. Suppl., 2018, no. 11,  81–86
  13. Propositional encoding of direct and inverse round transformations in attacks on some block ciphers

    Prikl. Diskr. Mat. Suppl., 2018, no. 11,  76–79
  14. Counteraction to conspiracy in discrete dynamical models of computers network

    UBS, 75 (2018),  76–102
  15. 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
  16. On one class of decision diagrams

    Avtomat. i Telemekh., 2016, no. 4,  84–98
  17. On discrete automaton models of attacks in computer networks

    Prikl. Diskr. Mat. Suppl., 2016, no. 9,  80–83
  18. Estimations of cryptographic resistance of ciphers in the Trivium family to SAT-based cryptanalysis

    Prikl. Diskr. Mat. Suppl., 2016, no. 9,  46–48
  19. Application of algorithms solving SAT problem to cryptanalysis of hash functions of MD family

    Prikl. Diskr. Mat. Suppl., 2015, no. 8,  139–142
  20. 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
  21. Analysis of discrete automaton models of gene networks with irregular structure using symbolic algorithms

    Diskretn. Anal. Issled. Oper., 21:3 (2014),  25–40
  22. 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
  23. On the effective representation of disjunctive normal forms by diagrams of a special kind

    Prikl. Diskr. Mat. Suppl., 2013, no. 6,  125–129
  24. GPU-based implementation of DPLL algorithm with limited non-chronological backtracking

    Prikl. Diskr. Mat. Suppl., 2013, no. 6,  111–112
  25. Dynamical properties of some discrete automaton mappings defined by random graphs

    Prikl. Diskr. Mat. Suppl., 2013, no. 6,  75–76
  26. Analysis of some discrete-automaton models of collective behavior

    UBS, 46 (2013),  266–292
  27. Constructing decomposition sets for distributed solution of sat problems in volunteer computing project sat@home

    UBS, 43 (2013),  138–156
  28. 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
  29. About convergence of a hybrid SAT+ROBDD-derivation

    Prikl. Diskr. Mat. Suppl., 2012, no. 5,  118–120
  30. Using volunteer computation to solve cryptographic problems

    Prikl. Diskr. Mat. Suppl., 2012, no. 5,  107–108
  31. Transformations of discrete functions calculation algorithms to boolean equations

    Bulletin of Irkutsk State University. Series Mathematics, 4:1 (2011),  83–96
  32. Application of SAT-approach for solving combinatorial problems

    Prikl. Diskr. Mat., 2011, no. supplement № 4,  68–69
  33. Technology for translating combinatorial problems into Boolean equations

    Prikl. Diskr. Mat., 2011, no. 1(11),  96–115
  34. Parallel algorithms for solving SAT-problems in application to optimization problems with Boolean constraints

    Num. Meth. Prog., 12:1 (2011),  205–212
  35. Cryptanalysis with graphical processing units (GPU)

    Prikl. Diskr. Mat., 2010, no. supplement № 3,  86–87
  36. Software translating of combinatorial problems to propositional logic

    Prikl. Diskr. Mat., 2010, no. supplement № 3,  81–82
  37. Algorithms using ROBDD as a base for Boolean constraints

    Prikl. Diskr. Mat., 2010, no. 1(7),  86–104
  38. A hybrid approach (SAT+ROBDD) to cryptanalysis of stream encryption systems

    Prikl. Diskr. Mat., 2009, no. supplement № 1,  19–20
  39. About tseitin's transformation in logical equations

    Prikl. Diskr. Mat., 2009, no. supplement № 1,  12–13
  40. About Tseitin transformation in logical equations

    Prikl. Diskr. Mat., 2009, no. 4(6),  28–50
  41. Analysis of some cryptographic primitives on computer clusters

    Prikl. Diskr. Mat., 2008, no. 2(2),  120–130
  42. Large-block parallelism technology in sat problems

    Probl. Upr., 2008, no. 1,  43–50
  43. Incomplete algorithms in the large-block parallelism of combinatorial problems

    Num. Meth. Prog., 9:1 (2008),  108–118
  44. On the complexity of the inversion of discrete functions of a certain class

    Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004),  44–55
  45. Clusterization of aviation fuel combustion products in jet behind supersonic aircraft

    Mat. Model., 11:4 (1999),  70–82
  46. 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

© Steklov Math. Inst. of RAS, 2025