Kosolapov Yurii Vladimirovich

Publications in Math-Net.Ru

1. The McEliece-type cryptosystem based on $D$-codes
   
   Mat. Vopr. Kriptogr., 15:2 (2024),  69–90
2. A method to quantitative compare obfuscating ttransformations
   
   Informatics and Automation, 23:3 (2024),  684–726
3. Fast computation of cyclic convolutions and their applications in code-based asymmetric encryption schemes
   
   Model. Anal. Inform. Sist., 30:4 (2023),  354–365
4. On simplifying expressions with mixed Boolean-arithmetic
   
   Model. Anal. Inform. Sist., 30:2 (2023),  140–159
5. Multi-party secure computation of multi-variable polynomials
   
   Vestnik YuUrGU. Ser. Mat. Model. Progr., 16:1 (2023),  81–95
6. 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
7. 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
8. A method to evaluate program similarity using machine learning methods
   
   Proceedings of ISP RAS, 34:5 (2022),  63–76
9. On characteristics of symbolic execution in the problem of assessing the quality of obfuscating transformations
   
   Model. Anal. Inform. Sist., 28:1 (2021),  38–51
10. IND-CCA2 secure McEliece-type modification in the standard model
    
    Mat. Vopr. Kriptogr., 12:2 (2021),  111–128
11. On decomposability of Schur — Hadamard product of the tensor products sum of Reed — Muller codes
    
    Prikl. Diskr. Mat. Suppl., 2021, no. 14,  158–161
12. Choosing parameters for one $\mathrm{IND}$-$\mathrm{CCA2}$ secure McEliece modification in the standard model
    
    Prikl. Diskr. Mat. Suppl., 2021, no. 14,  110–114
13. Error-tolerant ZZW-construction
    
    Sib. Èlektron. Mat. Izv., 18:2 (2021),  1506–1516
14. On one method for detecting exploitation of vulnerabilities and its parameters
    
    Sistemy i Sredstva Inform., 31:4 (2021),  48–60
15. Cryptanalysis of the BBCRS system on Reed–Muller binary code
    
    Vestnik YuUrGU. Ser. Mat. Model. Progr., 14:3 (2021),  18–32
16. On the detection of exploitation of vulnerabilities leading to the execution of a malicious code
    
    Model. Anal. Inform. Sist., 27:2 (2020),  138–151
17. On some properties of the Schur — Hadamard product for linear codes and their applications
    
    Prikl. Diskr. Mat., 2020, no. 50,  72–86
18. 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
19. Development and implementation of the conference secret key generation protocol based on IKE
    
    Vestn. YuUrGU. Ser. Vych. Matem. Inform., 9:1 (2020),  5–19
20. A method of protected distribution of data among unreliable and untrusted nodes
    
    Izv. Saratov Univ. Math. Mech. Inform., 19:3 (2019),  326–337
21. On the automatic analysis of the practical resistance of obfusting transformations
    
    Model. Anal. Inform. Sist., 26:3 (2019),  317–331
22. About detection of code reuse attacks
    
    Model. Anal. Inform. Sist., 26:2 (2019),  213–228
23. On the construction of a semantically secure modification of the McEliece cryptosystem
    
    Prikl. Diskr. Mat., 2019, no. 45,  33–43
24. The data embedding method based on the secret sharing scheme
    
    Sistemy i Sredstva Inform., 29:3 (2019),  180–193
25. 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
26. 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
27. On the Berger–Loidreau cryptosystem on the tensor product of codes
    
    J. Comp. Eng. Math., 5:2 (2018),  16–33
28. The support splitting algorithm for induced codes
    
    Model. Anal. Inform. Sist., 25:3 (2018),  276–290
29. Using the fuzzy vault to correct inaccuracies in authentication data
    
    Sistemy i Sredstva Inform., 28:1 (2018),  156–176
30. Decoding the tensor product of $ \mathrm{MLD} $ codes and applications for code cryptosystems
    
    Model. Anal. Inform. Sist., 24:2 (2017),  239–252
31. Blakley type secret sharing scheme based on the intersection of subspaces
    
    Mat. Vopr. Kriptogr., 8:1 (2017),  13–30
32. Application of one method of linear code recognition to the wire-tap channel
    
    Prikl. Diskr. Mat., 2017, no. 35,  76–88
33. 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
34. Cryptosystem based on induced group codes
    
    Model. Anal. Inform. Sist., 23:2 (2016),  137–152
35. Confidentiality preserving scheme for the algorithm RAID-PIR
    
    Prikl. Diskr. Mat. Suppl., 2016, no. 9,  87–89
36. Search of an information message in noisy code blocks at repeated data transmission
    
    Prikl. Diskr. Mat. Suppl., 2016, no. 9,  55–57
37. Algorithms for majority decoding of group codes
    
    Model. Anal. Inform. Sist., 22:4 (2015),  464–482
38. Codes for a generalized wire-tap channel model
    
    Probl. Peredachi Inf., 51:1 (2015),  23–28
39. Evaluation of resistance of code noising in the distributed data storage
    
    Sistemy i Sredstva Inform., 25:4 (2015),  158–174
40. 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


41. 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
42. 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