RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Zaikin, Oleg Sergeevich

Statistics Math-Net.Ru
Total publications: 18
Scientific articles: 18

Number of views:
This page:334
Abstract pages:7075
Full texts:922
References:261
Senior Researcher
Candidate of technical sciences
E-mail: ,

http://www.mathnet.ru/eng/person46524
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru
2019
1. V. S. Kondratiev, A. A. Semenov, O. S. Zaikin, “Duplicates of conflict clauses in CDCL derivation and their usage to invert some cryptographic functions”, Vychisl. Metody Programm., 20:1 (2019),  54–66  mathnet
2018
2. 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, 11,  76–79  mathnet
2017
3. 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  mathnet  elib
2016
4. 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, 9,  46–48  mathnet
5. 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  mathnet  elib
2015
6. 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, 8,  139–142  mathnet
7. 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”, Vychisl. Metody Programm., 16:1 (2015),  61–77  mathnet
8. 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
9. O. S. Zaikin, A. A. Semenov, “Application of the Monte Carlo method for estimating the total time of solving the SAT problem in parallel”, Vychisl. Metody Programm., 15:1 (2014),  22–35  mathnet
2013
10. 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  mathnet
2012
11. A. A. Semenov, O. S. Zaikin, “Algorithms for constructing decomposition sets in application to coarse-grained parallelization of SAT problems”, The Bulletin of Irkutsk State University. Series Mathematics, 5:4 (2012),  79–94  mathnet
12. O. S. Zaikin, M. A. Posypkin, A. A. Semenov, “Using volunteer computation to solve cryptographic problems”, Prikl. Diskr. Mat. Suppl., 2012, 5,  107–108  mathnet
2011
13. O. S. Zaikin, “Solving of cryptanalysis problems in grid systems (by the example of BOINC)”, Prikl. Diskr. Mat., 2011, supplement № 4,  66–67  mathnet
14. O. S. Zaikin, I. V. Otpushchennikov, A. A. Semenov, “Parallel algorithms for solving SAT-problems in application to optimization problems with Boolean constraints”, Vychisl. Metody Programm., 12:1 (2011),  205–212  mathnet
2009
15. 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, supplement № 1,  19–20  mathnet
2008
16. 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, 2(2),  120–130  mathnet
17. O. S. Zaikin, A. A. Semenov, “Large-block parallelism technology in sat problems”, Probl. Upr., 2008, 1,  43–50  mathnet
18. A. A. Semenov, O. S. Zaikin, “Incomplete algorithms in the large-block parallelism of combinatorial problems”, Vychisl. Metody Programm., 9:1 (2008),  108–118  mathnet

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020