|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
O. S. Zaikin, “Preimage attack on 44-step MD4 compression function with weakened last step”, Prikl. Diskr. Mat. Suppl., 2024, no. 17, 90–93  |
|
2023 |
| 2. |
E. A. Maro, O. S. Zaikin, “Algebraic cryptanalysis of 9 rounds of lightweight block cipher Simon32/64”, Prikl. Diskr. Mat. Suppl., 2023, no. 16, 65–70 |
| 3. |
O. S. Zaikin, “Inverting 29-step MD5 compression function via SAT”, Prikl. Diskr. Mat. Suppl., 2023, no. 16, 36–40 |
1
|
|
2019 |
| 4. |
V. S. Kondratiev, A. A. Semenov, O. S. Zaikin, “Duplicates of conflict clauses in CDCL derivation and their usage to invert some cryptographic functions”, Num. Meth. Prog., 20:1 (2019), 54–66 |
|
2018 |
| 5. |
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 |
| 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. |
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
|
| 8. |
O. S. Zaikin, E. I. Vatutin, A. D. Zhuravlev, M. O. Manzyuk, “Applying high-performance computing to searching for triples of partially orthogonal Latin squares of order 10”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 5:3 (2016), 54–89 |
|
2015 |
| 9. |
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
|
| 10. |
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
|
| 11. |
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 |
|
2014 |
| 12. |
M. O. Manzyuk, O. S. Zaikin, M. A. Posypkin, “CluBORun: tool for utilizing idle resources of computing clusters in BOINC computing”, Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2014, no. 4, 3–11 |
| 13. |
O. S. Zaikin, A. A. Semenov, “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 |
4
|
|
2013 |
| 14. |
O. S. Zaikin, A. A. Semenov, M. A. Posypkin, “Constructing decomposition sets for distributed solution of sat problems in volunteer computing project sat@home”, UBS, 43 (2013), 138–156 |
4
|
|
2012 |
| 15. |
A. A. Semenov, O. S. Zaikin, “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 |
| 16. |
O. S. Zaikin, M. A. Posypkin, A. A. Semenov, “Using volunteer computation to solve cryptographic problems”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 107–108 |
|
2011 |
| 17. |
O. S. Zaikin, “Solving of cryptanalysis problems in grid systems (by the example of BOINC)”, Prikl. Diskr. Mat., 2011, no. supplement № 4, 66–67 |
| 18. |
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 |
|
2009 |
| 19. |
A. S. Ignat'ev, A. A. Semenov, D. V. Bespalov, O. S. Zaikin, “A hybrid approach (SAT+ROBDD) to cryptanalysis of stream encryption systems”, Prikl. Diskr. Mat., 2009, no. supplement № 1, 19–20 |
|
2008 |
| 20. |
A. A. Semenov, O. S. Zaikin, D. V. Bespalov, P. S. Burov, A. E. Hmelnov, “Analysis of some cryptographic primitives on computer clusters”, Prikl. Diskr. Mat., 2008, no. 2(2), 120–130 |
| 21. |
O. S. Zaikin, A. A. Semenov, “Large-block parallelism technology in sat problems”, Probl. Upr., 2008, no. 1, 43–50 |
14
|
| 22. |
A. A. Semenov, O. S. Zaikin, “Incomplete algorithms in the large-block parallelism of combinatorial problems”, Num. Meth. Prog., 9:1 (2008), 108–118 |
3
|
|
| Organisations |
|
| |
|
|
Contact us: