Otpushchennikov Il'ya Vladimirovich

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. Search for linearizing sets in algebraic cryptanalysis as a problem of pseudo-Boolean optimization
   
   Prikl. Diskr. Mat. Suppl., 2019, no. 12,  130–134
3. Propositional encoding of direct and inverse round transformations in attacks on some block ciphers
   
   Prikl. Diskr. Mat. Suppl., 2018, no. 11,  76–79
4. 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
5. On one class of decision diagrams
   
   Avtomat. i Telemekh., 2016, no. 4,  84–98
6. Estimations of cryptographic resistance of ciphers in the Trivium family to SAT-based cryptanalysis
   
   Prikl. Diskr. Mat. Suppl., 2016, no. 9,  46–48
7. Application of algorithms solving SAT problem to cryptanalysis of hash functions of MD family
   
   Prikl. Diskr. Mat. Suppl., 2015, no. 8,  139–142
8. 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
9. Analysis of discrete automaton models of gene networks with irregular structure using symbolic algorithms
   
   Diskretn. Anal. Issled. Oper., 21:3 (2014),  25–40
10. Dynamical properties of some discrete automaton mappings defined by random graphs
    
    Prikl. Diskr. Mat. Suppl., 2013, no. 6,  75–76
11. Transformations of discrete functions calculation algorithms to boolean equations
    
    Bulletin of Irkutsk State University. Series Mathematics, 4:1 (2011),  83–96
12. Application of SAT-approach for solving combinatorial problems
    
    Prikl. Diskr. Mat., 2011, no. supplement № 4,  68–69
13. Technology for translating combinatorial problems into Boolean equations
    
    Prikl. Diskr. Mat., 2011, no. 1(11),  96–115
14. Parallel algorithms for solving SAT-problems in application to optimization problems with Boolean constraints
    
    Num. Meth. Prog., 12:1 (2011),  205–212
15. Software translating of combinatorial problems to propositional logic
    
    Prikl. Diskr. Mat., 2010, no. supplement № 3,  81–82