|
|
|
Publications in Math-Net.Ru |
Citations |
|
2021 |
| 1. |
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  |
|
2020 |
| 2. |
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 |
|
2019 |
| 3. |
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  |
2
|
|
2018 |
| 4. |
I. A. Gribanova, “New algorithm for relaxation constrains generation in the inversion problem of MD4-39”, Prikl. Diskr. Mat. Suppl., 2018, no. 11, 139–141 |
3
|
|
2017 |
| 5. |
I. A. Gribanova, “The inversion of cryptographic hash functions using unbalanced approximations of round functions”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 157–160 |
| 6. |
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 |
| 7. |
I. A. Gribanova, “Application of solving SAT algorithms to constructing differential paths for finding collisions of cryptographic hash functions in the MD family”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 129–132 |
|
2015 |
| 8. |
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
|
| 9. |
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
|
|
| Organisations |
|
| |
|
|
Contact us: