Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kochemazov, Stepan Evgen'evich
E-mail:

https://www.mathnet.ru/eng/person68780
List of publications on Google Scholar

Publications in Math-Net.Ru Citations
2025
1. S. E. Kochemazov, O. S. Zaikin, “Revisiting Dobbertin constraints for SAT-based preimage attacks on round-reduced MD4 compression function”, Prikl. Diskr. Mat. Suppl., 2025, no. 18,  265–270  mathnet
2. K. V. Antonov, V. S. Kondratiev, S. E. Kochemazov, A. A. Semenov, “Chosen plaintext algebraic attacks on the ciphers from the Simon family”, Prikl. Diskr. Mat. Suppl., 2025, no. 18,  252–258  mathnet
2016
3. 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
2015
4. 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 3
5. 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
6. O. S. Zaikin, S. E. Kochemazov, “The search for pairs of orthogonal diagonal latin squares of order 10 in the volunteer computing project SAT@home”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 4:3 (2015),  95–108  mathnet  elib
2014
7. 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 4
2013
8. 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
9. A. A. Semenov, S. E. Kochemazov, “Analysis of some discrete-automaton models of collective behavior”, UBS, 46 (2013),  266–292  mathnet 1
2011
10. 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

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   

Organisations