|
|
|
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  |
|
2019 |
| 2. |
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  |
2
|
|
2018 |
| 3. |
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 |
|
2017 |
| 4. |
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 |
1
|
|
2016 |
| 5. |
A. A. Semenov, I. V. Otpuschennikov, “On one class of decision diagrams”, Avtomat. i Telemekh., 2016, no. 4, 84–98 ; Autom. Remote Control, 77:4 (2016), 617–628   |
3
|
| 6. |
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 |
1
|
|
2015 |
| 7. |
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 |
2
|
| 8. |
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 |
2
|
|
2014 |
| 9. |
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 ; J. Appl. Industr. Math., 8:3 (2014), 307–316 |
3
|
|
2013 |
| 10. |
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 |
|
2011 |
| 11. |
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 |
| 12. |
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 |
| 13. |
I. V. Otpuschennikov, A. A. Semenov, “Technology for translating combinatorial problems into Boolean equations”, Prikl. Diskr. Mat., 2011, no. 1(11), 96–115 |
16
|
| 14. |
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 |
|
2010 |
| 15. |
I. V. Otpuschennikov, A. A. Semenov, “Software translating of combinatorial problems to propositional logic”, Prikl. Diskr. Mat., 2010, no. supplement № 3, 81–82 |
|
| Organisations |
|
| |
|
|
Contact us: