default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYu. V. Kosolapov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j10]Yu. V. Kosolapov
:
On Simplifying Mixed Boolean-Arithmetic Expressions. Autom. Control. Comput. Sci. 58(7): 836-852 (2024)- 2023
- [j9]Yury V. Kosolapov, Fedor S. Pevnev, Margarita V. Yagubyants:
On Building Self-Complementary Codes and Their Application in Information Hiding. Autom. Control. Comput. Sci. 57(7): 772-787 (2023) - 2022
- [j8]Petr Dmitrievich Borisov, Yury V. Kosolapov:
On the Characteristics of Symbolic Execution in the Problem of Assessing the Quality of Obfuscating Transformations. Autom. Control. Comput. Sci. 56(7): 595-605 (2022) - [j7]Yury V. Kosolapov:
Erratum to: On the Detection of Exploitation of Vulnerabilities That Leads to the Execution of a Malicious Code. Autom. Control. Comput. Sci. 56(7): 828 (2022) - 2021
- [j6]Yury V. Kosolapov:
On the Detection of Exploitation of Vulnerabilities That Leads to the Execution of a Malicious Code. Autom. Control. Comput. Sci. 55(7): 827-837 (2021) - 2020
- [j5]Yury V. Kosolapov:
On Detecting Code Reuse Attacks. Autom. Control. Comput. Sci. 54(7): 573-583 (2020) - [j4]Petr Dmitrievich Borisov, Yury V. Kosolapov:
On the Automatic Analysis of the Practical Resistance of Obfuscating Transformations. Autom. Control. Comput. Sci. 54(7): 619-629 (2020) - 2019
- [j3]Yu. V. Kosolapov, A. N. Shigaev:
On the Support Splitting Algorithm for Induced Codes. Autom. Control. Comput. Sci. 53(7): 719-729 (2019) - 2018
- [j2]Vladimir M. Deundyak, Yu. V. Kosolapov, E. A. Lelyuk:
Decoding the Tensor Product of MLD Codes and Applications for Code Cryptosystems. Autom. Control. Comput. Sci. 52(7): 647-657 (2018) - 2015
- [j1]Yu. V. Kosolapov:
Codes for a generalized wire-tap channel model. Probl. Inf. Transm. 51(1): 20-24 (2015)
Conference and Workshop Papers
- 2023
- [c5]Kirill V. Vedenev, Yu. V. Kosolapov:
Theoretical Analysis of Decoding Failure Rate of Non-binary QC-MDPC Codes. CBCrypto 2023: 35-55 - 2022
- [c4]Kirill V. Vedenev, Yu. V. Kosolapov:
Cryptanalysis of Ivanov-Krouk-Zyablov Cryptosystem. CBCrypto 2022: 137-153 - 2021
- [c3]Kirill V. Vedenev, Yury V. Kosolapov:
On Squares of Dihedral Codes. REDUNDANCY 2021: 55-60 - 2020
- [c2]Vladimir M. Deundyak, Yury V. Kosolapov, Igor A. Maystrenko:
On the Decipherment of Sidel'nikov-Type Cryptosystems. CBCrypto 2020: 20-40 - 2019
- [c1]Vladimir M. Deundyak, Yu. V. Kosolapov:
On the strength of asymmetric code cryptosystems based on the merging of generating matrices of linear codes. REDUNDANCY 2019: 143-148
Informal and Other Publications
- 2023
- [i2]Kirill V. Vedenev, Yury V. Kosolapov:
Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes. IACR Cryptol. ePrint Arch. 2023: 1224 (2023) - 2022
- [i1]Kirill V. Vedenev, Yury V. Kosolapov:
Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem. IACR Cryptol. ePrint Arch. 2022: 1666 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 19:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
