default search action
Vladyslav Kovtun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c7]Oleksandr Kurbatov, Pavel Kravchenko, Oleksiy Shapoval, Nikolay Poluyanenko, Mariana Malchyk, Alina Sakun, Vladyslav Kovtun:
Anonymous Decentralized E-Voting System. CMiGIN 2019: 12-22 - [c6]Pylyp Prystavka, Vladyslav Sorokopud, Artem Chyrkov, Vladyslav Kovtun:
Automated Complex for Aerial Reconnaissance Tasks in Modern Armed Conflicts. CMiGIN 2019: 57-66 - [c5]Zohaib Hassan, Roman Odarchenko, Abnash Zaman, Vladyslav Kovtun:
Modern Ontology and Deep Analysis of Global Social Networks Exploitation. COAPSN 2019: 220-229 - [c4]Hanna Polozhevets, Oleksandr Sytnik, Dariia Ovcharenko, Yurii Vitruck, Vladyslav Kovtun:
Optimal Configuration and Typical Size of Images Re-ceived by Unmanned Aerial Vehicles during Monitoring. CybHyg 2019: 352-362 - [c3]Andrew Okhrimenko, Vladyslav Kovtun:
Experimental Research of the Developed Methods of Arithmetic Operations in Cryptographic Transformations according to the ECDSA Scheme. CybHyg 2019: 827-837 - 2014
- [i8]Vladyslav Kovtun, Andrew Okhrimenko:
Squaring Algorithms with Delayed Carry Method and Efficient Parallelization. IACR Cryptol. ePrint Arch. 2014: 214 (2014) - [i7]Vladyslav Kovtun, Maria Bulakh:
Performance Increasing Approaches For Binary Field Inversion. IACR Cryptol. ePrint Arch. 2014: 561 (2014) - 2012
- [i6]Vladyslav Kovtun, Andrew Okhrimenko:
Approaches for the performance increasing of software implementation of integer multiplication in prime fields. IACR Cryptol. ePrint Arch. 2012: 170 (2012) - [i5]Vladyslav Kovtun, Andrew Okhrimenko:
Approaches for the Parallelization of Software Implementation of Integer Multiplication. IACR Cryptol. ePrint Arch. 2012: 482 (2012) - 2010
- [i4]Vladyslav Kovtun, Irina Sagir:
Co-Z Divisor Addition Formulae in Jacobian of Genus 2 Hyperelliptic Curves over Prime Fields. IACR Cryptol. ePrint Arch. 2010: 498 (2010)
2000 – 2009
- 2009
- [c2]Yuriy I. Izbenko, Vladyslav Kovtun
, Alexandr Kuznetsov
The Design of Boolean Functions by Modified Hill Climbing Method. ITNG 2009: 356-361 - 2008
- [i3]Vladyslav Kovtun, Thomas J. Wollinger:
Fast explicit formulae for genus 2 hyperelliptic curves using projective coordinates (Updated). IACR Cryptol. ePrint Arch. 2008: 56 (2008) - [i2]Vladyslav Kovtun, Jan Pelzl, Alexandr Kuznetsov:
Software Implementation of Genus-2 Hyperelliptic Curve Cryptosystems Over Prime Fields. IACR Cryptol. ePrint Arch. 2008: 57 (2008) - [i1]Yuriy I. Izbenko, Vladyslav Kovtun, Alexandr Kuznetsov:
The Design of Boolean Functions by Modified Hill Climbing Method. IACR Cryptol. ePrint Arch. 2008: 111 (2008) - 2007
- [c1]Thomas J. Wollinger, Vladyslav Kovtun
Fast explicit formulae for genus 2 hyperelliptic curves using projective coordinates. ITNG 2007: 893-897
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 2024-10-07 22:16 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: