Yury Kosolapov

Yury Kosolapov
Southern Federal University | sfedu · Department of Algebra and Discrete Mathematics

PhD

About

56
Publications
2,235
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
98
Citations
Introduction
Yury Kosolapov currently works at the Department of Algebra and Discrete Mathematics, Southern Federal University. Yury does research in Applied Mathematics. Their current project is 'Methods for lightweight data protection'.
Additional affiliations
September 2009 - present
Southern Federal University
Position
  • Professor (Associate)
March 2007 - March 2018
Rostelecom
Position
  • Group Leader

Publications

Publications (56)
Article
Developing more accurate and adaptive methods for detecting malicious code is a critical challenge in the context of constantly evolving cybersecurity threats. This requires constant attention to new vulnerabilities and attack methods, as well as the search for innovative approaches to detecting and preventing cyber threats. The paper examines an a...
Article
Full-text available
The paper considers the problem of quantitative comparison of potency and resistance of practically applied obfuscating transformations of program code. A method is proposed to find the potency and resistance of transformations by calculating the «comprehensibility» of the obfuscated and deobfuscated versions of a program, respectively. As a measur...
Article
Full-text available
The development of fast algorithms for key generation, encryption and decryption not only increases the efficiency of related operations. Such fast algorithms, for example, for asymmetric cryptosystems on quasi-cyclic codes, make it possible to experimentally study the dependence of decoding failure rate on code parameters for small security levels...
Chapter
In this paper, we study the decoding failure rate (DFR) of non-binary QC-MDPC codes using theoretical tools, extending the results of previous binary QC-MDPC code studies. The theoretical estimates of the DFR are particularly significant for cryptographic applications of QC-MDPC codes. Specifically, in the binary case, it is established that exploi...
Article
Full-text available
Mixed Boolean-Arithmetic expressions (MBA-expressions) with $t$ integer $n$-bit variables are often used for program obfuscations. Obfuscation consists of replacing short expressions with longer equivalent expressions that seem to take the analyst more time to explore. The paper shows that to simplify linear MBA-expressions (reduce the number of te...
Chapter
Recently, F. Ivanov, E. Krouk and V. Zyablov proposed new cryptosystem based of Generalized Reed–Solomon (GRS) codes over field extensions. In their approach, the subfield images of GRS codes are masked by a special transform, so that the resulting public codes are not equivalent to subfield images of GRS code but burst errors still can be decoded....
Article
Obfuscation is used to protect programs from analysis and reverse engineering. There are theoretically effective and resistant obfuscation methods, however, most of them are not implemented in practice yet. The main issues are the large overhead for the execution of obfuscated code and the limitation of application only to a specific class of progr...
Article
Full-text available
Line codes are widely used to protect against errors in data transmission and storage systems, to ensure the stability of various cryptographic algorithms and protocols, to protect hidden information from errors in a stegocontainer. One of the classes of codes that find application in a number of the listed areas is the class of linear self-complem...
Article
The current task of cryptography is the development of cryptosystems resistant to attacks using quantum computing. One of the promising encryption schemes is the McEliece system based on Goppa codes. However, this system has a number of disadvantages due to the structure of Goppa codes, which makes it relevant to search for other codes for the McEl...
Article
The problem of constructing an algorithm for comparing two executable files is considered. The algorithm is based on the construction of similarity features vector for a given pair of programs. This vector is then used to decide on the similarity or dissimilarity of programs using machine learning methods. Similarity features are built using algori...
Article
Full-text available
In 2008 Zhang, Zhang, and Wang proposed a steganographic construction that is close to upper bound of efficiency. However this system and many other are fragile to errors in the stegocontainer. Such errors can occur for example during the image processing. In this paper the ZZW-construction is modified for extracting data if errors and erasures occ...
Article
Full-text available
In the article by 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; https://doi.org/10.18255/1818-1015-2020-2-138-151) an inaccurate description of the algorithm CheckTrace is committed. The correct desc...
Article
Full-text available
The main goal of this work is to construct a McEliece type cryptosystem with IND-CCA2 property in the standard model and an effective data transfer rate. The proposed modification is based on the application of the s-repetition method and uses one common secret permutation. The modification uses the transmission of s encrypted blocks for s/2 inform...
Article
Full-text available
Obfuscation is used to protect programs from analysis and reverse engineering. There are theoretically effective and resistant obfuscation methods, but most of them are not implemented in practice yet. The main reasons are large overhead for the execution of obfuscated code and the limitation of application only to a specific class of programs. On...
Chapter
Asymmetric Sidel’nikov-type code-based cryptosystem is one of the generalizations of McEliece-type cryptosystems. The secret key in this generalization is the set of u randomly selected generator matrices \(G_{C_1}\),...,\(G_{C_u}\) of different \( [n_i, k] \)-codes \( C_i \), \( i \in \{1, ..., u \} \). In addition, a part of the secret key is a r...
Article
Full-text available
Software protection from exploitation of possible unknown vulnerabilities can be performed both by searching (for example, using symbolic execution) and subsequent elimination of the vulnerabilities and by using detection and / or intrusion prevention systems. In the latter case, this problem is usually solved by forming a profile of a normal behav...
Article
Full-text available
A method is developed for assessing the practical persistence of obfuscating transformations of programs based on the calculation of the similarity index for the original, obfuscated and deobfuscated programs. Candidates are proposed for similarity indices, which are based on such program characteristics as the control flow graph, symbolic executio...
Article
Full-text available
We consider a model of protecting the confidentiality and recoverability of data in a distributed storage system. It is assumed that in- formational blocks are coded into the code blocks. Then the blocks are divided into parts and distributed among repositories of the distributed storage. A modification of the code noising method is con- structed w...
Article
Full-text available
When exploiting software vulnerabilities such as buffer overflows, code reuse techniques are often used today. Such attacks allow you to bypass the protection against the execution of code in the stack, which is implemented at the software and hardware level in modern information systems. At the heart of these attacks lies the detection, in the vul...
Article
Full-text available
For the practical application of code cryptosystems such as McEliece, the code used in the cryptosystem should have a fast decoding algorithm. On the other hand, the code used must ensure that finding a secret key from a known public key is impractical with a relatively small key size. In this connection, in the present paper it is proposed to use...
Article
In the paper, the analysis of the stability of the McEliece-type cryptosystem on induced codes for key attacks is examined. In particular, a model is considered when the automorphism group is trivial for the base code C, on the basis of which the induced code F l q ⊗ C is constructed. In this case, as shown by N. Sendrier in 2000, there exists such...
Article
For the practical application of code cryptosystems such as McEliece, it is necessary that the code used in the cryptosystem has a fast decoding algorithm. On the other hand, the code used must be such that finding a secret key from a known public key would be impractical with a relatively small key size. In connection with this, in the present pap...
Article
Full-text available
A security model using the method of code noising is considered. It is assumed that the information blocks of length $ k $ contain a fixed message $ \mathbf{m} $ of length $m_l$ $ (m_l \leq k) $ on a fixed position $m_s$ $(1 \leq m_s \leq k-m_l + 1)$, and an observer gets noisy codewords of length $ n $ through a $q$-ary symmetric channel $q\mathrm...
Patent
Full-text available
The invention relates to the protection of privacy and data availability in a distributed storage. In the method of privacy protection and availability of stored data (MPPASD) for each information block from a given set of encoding rules randomly chosen number r of encoding rules is then applied to the code block; received codeword t is broken up i...
Article
Full-text available
The code C on a group G, induced by the code N on a subgroup H, has the property that for decoding the code C one can use the decoder for the code N. Therefore, if N has an efficient algorithm for decoding, we can build a class of induced codes with known decoding algorithms. This feature is used in this paper to build the code McEliece-type public...
Article
Full-text available
We consider a problem of constructive description and justification of the algorithms necessary for a practical implementation of the majority decoder for group codes specified as left ideals of groupalgebras. In addition to the algorithms needed to implement a classical decoder of J. Massey, it is built a generalization of the classical decoder for...
Article
We consider a model of a wire-tap channel generalizing some previously known models. It is assumed that in a channel between two legal parties there can be errors, and an adversary is possible to observe both a part of a code vector and a part of the corresponding information vector.

Network

Cited By