Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kosolapov, Yurii Vladimirovich
Statistics Math-Net.Ru
Total publications: 43
Scientific articles: 41

Number of views:
This page:3086
Abstract pages:11825
Full texts:4115
References:1124
Associate professor
Candidate of technical sciences
E-mail:

https://www.mathnet.ru/eng/person79123
List of publications on Google Scholar
List of publications on ZentralBlatt
https://orcid.org/0000-0002-1491-524X

Publications in Math-Net.Ru Citations
2024
1. Yu. V. Kosolapov, T. A. Pavlova, “On the study of one way to detect anomalous program execution”, Model. Anal. Inform. Sist., 31:2 (2024),  152–163  mathnet
2. Yu. V. Kosolapov, E. A. Lelyuk, “The McEliece-type cryptosystem based on $D$-codes”, Mat. Vopr. Kriptogr., 15:2 (2024),  69–90  mathnet
3. P. Borisov, Yu. Kosolapov, “A method to quantitative compare obfuscating ttransformations”, Informatics and Automation, 23:3 (2024),  684–726  mathnet
2023
4. A. N. Sushko, B. Y. Steinberg, K. V. Vedenev, A. A. Glukhikh, Y. V. Kosolapov, “Fast computation of cyclic convolutions and their applications in code-based asymmetric encryption schemes”, Model. Anal. Inform. Sist., 30:4 (2023),  354–365  mathnet
5. Y. V. Kosolapov, “On simplifying expressions with mixed Boolean-arithmetic”, Model. Anal. Inform. Sist., 30:2 (2023),  140–159  mathnet
6. Yu. V. Kosolapov, “Multi-party secure computation of multi-variable polynomials”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 16:1 (2023),  81–95  mathnet
2022
7. Yu. V. Kosolapov, F. S. Pevnev, M. V. Yagubyants, “On the construction of self-complementary codes and their application in the problem of information hiding”, Model. Anal. Inform. Sist., 29:3 (2022),  182–198  mathnet  mathscinet 1
8. Yu. V. Kosolapov, E. A. Lelyuk, “On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed — Muller codes”, Prikl. Diskr. Mat., 2022, no. 57,  22–39  mathnet  mathscinet 1
9. P. D. Borisov, Yu. V. Kosolapov, “A method to evaluate program similarity using machine learning methods”, Proceedings of ISP RAS, 34:5 (2022),  63–76  mathnet 1
2021
10. P. D. Borisov, Yu. V. Kosolapov, “On characteristics of symbolic execution in the problem of assessing the quality of obfuscating transformations”, Model. Anal. Inform. Sist., 28:1 (2021),  38–51  mathnet
11. Yu. V. Kosolapov, O. Yu. Turchenko, “IND-CCA2 secure McEliece-type modification in the standard model”, Mat. Vopr. Kriptogr., 12:2 (2021),  111–128  mathnet
12. Yu. V. Kosolapov, E. A. Lelyuk, “On decomposability of Schur — Hadamard product of the tensor products sum of Reed — Muller codes”, Prikl. Diskr. Mat. Suppl., 2021, no. 14,  158–161  mathnet
13. Y. V. Kosolapov, O. Y. Turchenko, “Choosing parameters for one $\mathrm{IND}$-$\mathrm{CCA2}$ secure McEliece modification in the standard model”, Prikl. Diskr. Mat. Suppl., 2021, no. 14,  110–114  mathnet
14. Yu. V. Kosolapov, F. S. Pevnev, “Error-tolerant ZZW-construction”, Sib. Èlektron. Mat. Izv., 18:2 (2021),  1506–1516  mathnet  isi 2
15. Yu. V. Kosolapov, “On one method for detecting exploitation of vulnerabilities and its parameters”, Sistemy i Sredstva Inform., 31:4 (2021),  48–60  mathnet
16. Yu. V. Kosolapov, A. A. Lelyuk, “Cryptanalysis of the BBCRS system on Reed–Muller binary code”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 14:3 (2021),  18–32  mathnet
2020
17. Yu. V. Kosolapov, “On the detection of exploitation of vulnerabilities leading to the execution of a malicious code”, Model. Anal. Inform. Sist., 27:2 (2020),  138–151  mathnet 1
18. V. M. Deundyak, Yu. V. Kosolapov, “On some properties of the Schur — Hadamard product for linear codes and their applications”, Prikl. Diskr. Mat., 2020, no. 50,  72–86  mathnet 5
19. Y. V. Kosolapov, O. Y. Turchenko, “Efficient $S$-repetition method for constructing an IND-CCA2 secure McEliece modification in the standard model”, Prikl. Diskr. Mat. Suppl., 2020, no. 13,  80–84  mathnet 1
20. A. A. Volokhov, Yu. V. Kosolapov, “Development and implementation of the conference secret key generation protocol based on IKE”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 9:1 (2020),  5–19  mathnet
2019
21. Yu. V. Kosolapov, F. S. Pevnev, “A method of protected distribution of data among unreliable and untrusted nodes”, Izv. Saratov Univ. Math. Mech. Inform., 19:3 (2019),  326–337  mathnet  isi  elib
22. P. D. Borisov, Yu. V. Kosolapov, “On the automatic analysis of the practical resistance of obfusting transformations”, Model. Anal. Inform. Sist., 26:3 (2019),  317–331  mathnet 2
23. Yu. V. Kosolapov, “About detection of code reuse attacks”, Model. Anal. Inform. Sist., 26:2 (2019),  213–228  mathnet 3
24. Y. V. Kosolapov, O. Y. Turchenko, “On the construction of a semantically secure modification of the McEliece cryptosystem”, Prikl. Diskr. Mat., 2019, no. 45,  33–43  mathnet  isi 4
25. Yu. V. Kosolapov, “The data embedding method based on the secret sharing scheme”, Sistemy i Sredstva Inform., 29:3 (2019),  180–193  mathnet
26. V. M. Deundyak, Yu. V. Kosolapov, “The use of the direct sum decomposition algorithm for analyzing the strength of some McEliece type cryptosystems”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 12:3 (2019),  89–101  mathnet  elib 5
2018
27. Yu. V. Kosolapov, “On the construction of $(n,k)$-schemes of visual cryptography using a class of linear hash functions over a binary field”, Izv. Saratov Univ. Math. Mech. Inform., 18:2 (2018),  227–239  mathnet  elib 1
28. V. M. Deundyak, Yu. V. Kosolapov, “On the Berger–Loidreau cryptosystem on the tensor product of codes”, J. Comp. Eng. Math., 5:2 (2018),  16–33  mathnet  mathscinet  elib 3
29. Yu. V. Kosolapov, A. N. Shigaev, “The support splitting algorithm for induced codes”, Model. Anal. Inform. Sist., 25:3 (2018),  276–290  mathnet  elib 1
30. D. E. Gordienko, Yu. V. Kosolapov, A. S. Mishko, “Using the fuzzy vault to correct inaccuracies in authentication data”, Sistemy i Sredstva Inform., 28:1 (2018),  156–176  mathnet  elib
2017
31. V. M. Deundyak, Yu. V. Kosolapov, E. A. Lelyuk, “Decoding the tensor product of $ \mathrm{MLD} $ codes and applications for code cryptosystems”, Model. Anal. Inform. Sist., 24:2 (2017),  239–252  mathnet  elib 4
32. Yu. V. Kosolapov, “Blakley type secret sharing scheme based on the intersection of subspaces”, Mat. Vopr. Kriptogr., 8:1 (2017),  13–30  mathnet  mathscinet  elib 2
33. Y. V. Kosolapov, O. Y. Turchenko, “Application of one method of linear code recognition to the wire-tap channel”, Prikl. Diskr. Mat., 2017, no. 35,  76–88  mathnet 1
34. N. A. Zorina, Y. V. Kosolapov, “Construction of $(4,8)$-schemes of visual cryptography on the base of a class of linear hash functions”, Prikl. Diskr. Mat. Suppl., 2017, no. 10,  81–83  mathnet
2016
35. V. M. Deundyak, Yu. V. Kosolapov, “Cryptosystem based on induced group codes”, Model. Anal. Inform. Sist., 23:2 (2016),  137–152  mathnet  mathscinet  elib 14
36. M. R. Kascheev, Y. V. Kosolapov, “Confidentiality preserving scheme for the algorithm RAID-PIR”, Prikl. Diskr. Mat. Suppl., 2016, no. 9,  87–89  mathnet
37. Y. V. Kosolapov, O. Y. Turchenko, “Search of an information message in noisy code blocks at repeated data transmission”, Prikl. Diskr. Mat. Suppl., 2016, no. 9,  55–57  mathnet 1
2015
38. V. M. Deundyak, Yu. V. Kosolapov, “Algorithms for majority decoding of group codes”, Model. Anal. Inform. Sist., 22:4 (2015),  464–482  mathnet  mathscinet  elib 13
39. Yu. V. Kosolapov, “Codes for a generalized wire-tap channel model”, Probl. Peredachi Inf., 51:1 (2015),  23–28  mathnet  mathscinet  elib; Problems Inform. Transmission, 51:1 (2015), 20–24  isi  scopus 4
40. Yu. V. Kosolapov, A. V. Pozdnyakov, “Evaluation of resistance of code noising in the distributed data storage”, Sistemy i Sredstva Inform., 25:4 (2015),  158–174  mathnet  elib 1
2012
41. V. M. Deundyak, J. V. Kosolapov, “On the Firmness Code Noising to the Statistical Analysis of the Observable Data of Repeated Repetition”, Model. Anal. Inform. Sist., 19:4 (2012),  110–127  mathnet  elib 3
2021
42. Yu. V. Kosolapov, “Corrigendum to: Y. V. Kosolapov, “On the detection of exploitation of vulnerabilities leading to the execution of a malicious code”, Modeling and analysis of information systems, vol. 27, no. 2, pp. 138-151, 2020. doi: https://doi.org/10.18255/1818-1015-2020-2-138-151”, Model. Anal. Inform. Sist., 28:3 (2021),  314–316  mathnet
2014
43. I. I. Vinnichuk, Y. V. Kosolapov, “The evaluation of code noising security against the $l$-fold partial data observation in the network”, Prikl. Diskr. Mat., 2014, no. 4(26),  62–71  mathnet

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024