default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVasyl Ustimenko
Vasiliy A. Ustimenko
Person information
- affiliation: Maria Curie-Skłodowska University, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c26]Vasyl Ustimenko, Oleksandr Pustovit:
Implementation of New Families of Graph-based Stream Ciphers with the Hidden Multivariate Nature. CPITS 2024: 1-14- [e5]Volodymyr Sokolov, Vasyl Ustimenko, Tamara Radivilova, Mariya Nazarkevych:
Proceedings of the Workshop Cybersecurity Providing in Information and Telecommunication Systems (CPITS 2024), Kyiv, Ukraine, February 28, 2024 (online). CEUR Workshop Proceedings 3654, CEUR-WS.org 2024 [contents] - [i29]Vasyl Ustimenko:
On short digital signatures with Eulerian transformations. IACR Cryptol. ePrint Arch. 2024: 1 (2024) - [i28]Vasyl Ustimenko:
On historical Multivariate Cryptosystems and their restorations as instruments of Post-Quantum Cryptography. IACR Cryptol. ePrint Arch. 2024: 91 (2024) - [i27]Vasyl Ustimenko:
On the cryptosystems based on two Eulerian transfor-mations defined over the commutative rings Z2s, s>1. IACR Cryptol. ePrint Arch. 2024: 319 (2024) - [i26]Tymoteusz Chojecki, Grahame Erskine, James Tuite, Vasyl Ustimenko:
On affine forestry over integral domains and families of deep Jordan-Gauss graphs. IACR Cryptol. ePrint Arch. 2024: 1156 (2024) - [i25]Vasyl Ustimenko:
On Schubert cells of Projective Geometry and quadratic public keys of Multivariate Cryptography. IACR Cryptol. ePrint Arch. 2024: 1480 (2024) - [i24]Vasyl Ustimenko, Tymoteusz Chojecki, Aneta Wróblewska:
On the Jordan-Gauss graphs and new multivariate public keys. IACR Cryptol. ePrint Arch. 2024: 1793 (2024) - 2023
- [c25]Vasyl Ustimenko, Oleksandr Pustovit:
Families of Stream Ciphers based on Non-Bijective Multivariate Encryption Maps of High Degree. CPITS II 2023: 107-120 - [c24]Vasyl Ustimenko, Oleksandr Pustovit:
Expanding Extremal Graphs and Implemented Solutions of Post Quantum Cryptography. CPITS 2023: 127-137 - [c23]Vasyl Ustimenko:
Linear Codes of Schubert Type and Quadratic Public Keys of Multivariate Cryptography (short paper). CQPC 2023: 50-56 - [c22]Vasyl Ustimenko
, Aneta Wróblewska:
Extremal algebraic graphs, quadratic multivariate public keys and temporal rules. FedCSIS 2023: 1173-1178 - [c21]Vasyl Ustimenko, Tymoteusz Chojecki, Michal Klisowski:
On Extremal Algebraic Graphs and implementations of new cubic Multivariate Public Keys. FedCSIS 2023: 1179-1184 - [c20]Vasyl Ustimenko, Oleksandr Pustovit:
On families of stream ciphers based on the approximations of regular forests. ITTAP 2023: 533-547 - [c19]Vasyl Ustimenko:
Schubert cells and quadratic public keys of Multivariate Cryptography. ITTAP 2023: 598-604 - [e4]Volodymyr Sokolov, Tamara Radivilova, Vasyl Ustimenko, Mariya Nazarkevych:
Proceedings of the Cybersecurity Providing in Information and Telecommunication Systems, CPITS 2023, co-located with International Conference on Problems of Infocommunications. Science and Technology (PICST 2023), Kyiv, Ukraine, February 28, 2023 (online). CEUR Workshop Proceedings 3421, CEUR-WS.org 2023 [contents] - [e3]Volodymyr Sokolov, Tamara Radivilova, Vasyl Ustimenko, Mariya Nazarkevych:
Proceedings of the Cybersecurity Providing in Information and Telecommunication Systems II co-located with International Conference on Problems of Infocommunications. Science and Technology (PICST 2023), Kyiv, Ukraine, October 26, 2023 (online). CEUR Workshop Proceedings 3550, CEUR-WS.org 2023 [contents] - [e2]Volodymyr Sokolov, Vasyl Ustimenko, Mariya Nazarkevych:
Proceedings of the Workshop on Classic, Quantum, and Post-Quantum Cryptography (CQPC 2023) co-located with International Conference on Problems of Infocommunications. Science and Technology (PICST 2023), Kyiv, Ukraine, August 1, 2023 (online). CEUR Workshop Proceedings 3504, CEUR-WS.org 2023 [contents] - [i23]Vasyl Ustimenko:
Linear codes of Schubert type and quadratic public keys of Multivariate Cryptography. IACR Cryptol. ePrint Arch. 2023: 175 (2023) - [i22]Vasyl Ustimenko, Tymoteusz Chojecki:
On implemented graph based generator of cryptographically strong pseudorandom sequences of multivariate nature. IACR Cryptol. ePrint Arch. 2023: 733 (2023) - [i21]Vasyl Ustimenko, Aneta Wróblewska:
Extremal algebraic graphs, quadratic multivariate public keys and temporal rules. IACR Cryptol. ePrint Arch. 2023: 738 (2023) - [i20]Vasyl Ustimenko, Tymoteusz Chojecki, Michal Klisowski:
On Extremal Algebraic Graphs and implementations of new cubic Multivariate Public Keys. IACR Cryptol. ePrint Arch. 2023: 744 (2023) - 2022
- [c18]Vasyl Ustimenko, Oleksandr Pustovit:
On-Time Dependent Linguistic Graphs and Solutions of Postquantum Multivariate Cryptography (short paper). CPITS 2022: 96-103 - [c17]Vasyl Ustimenko, Tymoteusz Chojecki:
On Multivariate Maps of High Degree for the Post Quantum Protection of Virtual Organizations (short paper). CPITS 2022: 156-161 - [c16]Vasyl Ustimenko, Michal Klisowski:
On D(n; q) quotients of large girth and hidden homomorphism based cryptographic protocols. FedCSIS (Communication Papers) 2022: 199-206 - [e1]Volodymyr Sokolov, Tamara Radivilova, Vasyl Ustimenko, Mariya Nazarkevych:
Proceedings of the Cybersecurity Providing in Information and Telecommunication Systems, CPITS 2022, co-located with International Conference on Problems of Infocommunications. Science and Technology (PICST 2022), Kyiv, Ukraine, October 13, 2022 (online). CEUR Workshop Proceedings 3288, CEUR-WS.org 2022 [contents] - [i19]Vasyl Ustimenko:
On new results on Extremal Graph Theory, Theory of Algebraic Graphs and their applications in Cryptography and Coding Theory. IACR Cryptol. ePrint Arch. 2022: 296 (2022) - [i18]Tymoteusz Chojecki, Vasyl Ustimenko:
On fast computations of numerical parameters of homogeneous algebraic graphs of large girth and small diameter and encryption of large files. IACR Cryptol. ePrint Arch. 2022: 908 (2022) - [i17]Vasyl Ustimenko:
New results on algebraic graphs of large girth and their impact on Extremal Graph Theory and Algebraic Cryptography. IACR Cryptol. ePrint Arch. 2022: 1489 (2022) - [i16]Vasyl Ustimenko:
On Extremal Algebraic Graphs and Multivariate Cryptosystems. IACR Cryptol. ePrint Arch. 2022: 1537 (2022) - [i15]Vasyl Ustimenko:
On the families of graphs with the fastest growth of girth and their usage in cryptography. IACR Cryptol. ePrint Arch. 2022: 1668 (2022) - 2021
- [c15]Vasyl Ustimenko, Oleksandr Pustovit:
New Cryptosystems of Noncommutative Cryptography based on Eulerian Semigroups of Multivariate Transformations (short paper). CPITS I 2021: 18-26 - [c14]Vasyl Ustimenko, Oleksandr Pustovit:
Eulerian Transformations and Postquantum Access Control Protocol-Based Algorithms (short paper). CPITS II (2) 2021: 251-256 - [i14]Vasyl Ustimenko:
On computations with Double Schubert Automaton and stable maps of Multivariate Cryptography. CoRR abs/2108.08288 (2021) - [i13]Vasyl Ustimenko:
On effective computations in special subsemigroups of polynomial transformations and protocol based multivariate cryptosystems. IACR Cryptol. ePrint Arch. 2021: 423 (2021) - [i12]Vasyl Ustimenko:
On Extremal Expanding Algebraic Graphs and post-quantum secure delivery of passwords, encryption maps and tools for multivariate digital signatures. IACR Cryptol. ePrint Arch. 2021: 898 (2021) - 2020
- [i11]Vasyl Ustimenko:
On Multivariate Algorithms of Digital Signatures on Secure El Gamal Type Mode. IACR Cryptol. ePrint Arch. 2020: 984 (2020) - [i10]Vasyl Ustimenko:
On Multivariate Algorithms of Digital Signatures of Linear Degree and Low Density. IACR Cryptol. ePrint Arch. 2020: 1015 (2020) - [i9]Vasyl Ustimenko:
On Multivariate Algorithms of Digital Signatures Based on Maps of Unbounded Degree Acting on Secure El Gamal Type Mode. IACR Cryptol. ePrint Arch. 2020: 1116 (2020)
2010 – 2019
- 2019
- [j27]Vasyl Ustimenko, Urszula Romanczuk-Polubiec, Aneta Wróblewska, Monika Katarzyna Polak, Eustrat Zhupa:
On the Constructions of New Symmetric Ciphers Based on Nonbijective Multivariate Maps of Prescribed Degree. Secur. Commun. Networks 2019: 2137561:1-2137561:15 (2019) - [c13]Vasyl Ustimenko, Urszula Romanczuk-Polubiec, Aneta Wróblewska:
Expanding graphs of the Extremal Graph Theory and expanded platforms of Post Quantum Cryptography. FedCSIS (Position Papers) 2019: 41-46 - [i8]Vasyl Ustimenko:
On semigroups of multiplicative Cremona transformations and new solutions of Post Quantum Cryptography. IACR Cryptol. ePrint Arch. 2019: 133 (2019) - [i7]Vasyl Ustimenko, Michal Klisowski:
On Noncommutative Cryptography and homomorphism of stable cubical multivariate transformation groups of infinite dimensional affine spaces. IACR Cryptol. ePrint Arch. 2019: 593 (2019) - [i6]Vasyl Ustimenko:
On inverse protocols of Post Quantum Cryptography based on pairs of noncommutative multivariate platforms used in tandem. IACR Cryptol. ePrint Arch. 2019: 897 (2019) - [i5]Vasyl Ustimenko:
On affine Cremona semigroups, corresponding protocols of Non-commutative Cryptography and encryption with several nonlinear multivariate transformations on secure Eulerian mode. IACR Cryptol. ePrint Arch. 2019: 1130 (2019) - 2018
- [c12]Vasyl Ustimenko, Urszula Romanczuk-Polubiec, Aneta Wróblewska, Monika Polak, Eustrat Zhupa:
On the implementation of new symmetric ciphers based on non-bijective multivariate maps. FedCSIS 2018: 397-405 - 2017
- [j26]Vasyl Ustimenko, Andrew J. Woldar:
A geometric approach to orbital recognition in Chevalley-type coherent configurations and association schemes. Australas. J Comb. 67: 166-202 (2017) - [i4]Vasyl Ustimenko:
On new multivariate cryptosystems based on hidden Eulerian equations over finite fields. IACR Cryptol. ePrint Arch. 2017: 93 (2017) - [i3]Vasyl Ustimenko:
On desynchronised El Gamal algorithm. IACR Cryptol. ePrint Arch. 2017: 712 (2017) - 2015
- [j25]Monika Polak, Vasyl Ustimenko:
Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes. Ann. UMCS Informatica 15(2): 14-21 (2015) - [p4]Michal Klisowski, Vasyl Ustimenko:
Graph based cubical multivariate maps and their cryptographical applications. Advances on Superelliptic Curves and their Applications 2015: 305-327 - 2014
- [j24]Vasyl Ustimenko:
On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition. Ann. UMCS Informatica 14(1): 7-17 (2014) - [j23]Aneta Wróblewska, Vasyl Ustimenko:
On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications. Ann. UMCS Informatica 14(1): 19-35 (2014) - [c11]Urszula Romanczuk-Polubiec, Vasyl Ustimenko:
On Multivariate Cryptosystems Based on Polynomially Compressed Maps with Invertible Decomposition. CSS 2014: 23-37 - [c10]Monika Polak, Vasyl Ustimenko:
On LDPC Codes Based on Families of Expanding Graphs of Increasing Girth without Edge-Transitive Automorphism Groups. CSS 2014: 74-88 - [c9]Vasyl Ustimenko:
On multivariate cryptosystems based on maps with logarithmically invertible decomposition corresponding to walk on graph. FedCSIS 2014: 631-637 - [i2]Urszula Romanczuk-Polubiec, Vasyl Ustimenko:
On two windows multivariate cryptosystem depending on random parameters. IACR Cryptol. ePrint Arch. 2014: 964 (2014) - 2013
- [j22]Monika Polak, Urszula Romanczuk, Vasyl Ustimenko, Aneta Wróblewska:
On the applications of Extremal Graph Theory to Coding Theory and Cryptography. Electron. Notes Discret. Math. 43: 329-342 (2013) - [j21]Vasyl Ustimenko, Aneta Wróblewska:
On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree. Ann. UMCS Informatica 13(1): 63-80 (2013) - [c8]Monika Polak, Vasyl Ustimenko:
Examples of Ramanujan and expander graphs for practical applications. FedCSIS 2013: 499-505 - [p3]Vasyl Ustimenko, Urszula Romanczuk:
On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography. Artificial Intelligence, Evolutionary Computing and Metaheuristics 2013: 231-256 - [p2]Vasyl Ustimenko, Urszula Romanczuk:
On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines. Artificial Intelligence, Evolutionary Computing and Metaheuristics 2013: 257-285 - [i1]Vasyl Ustimenko, Aneta Wróblewska:
On the key exchange with nonlinear polynomial maps of stable degree. CoRR abs/1304.2920 (2013) - 2012
- [j20]Urszula Romanczuk, Vasyl Ustimenko:
On Families of Graphs of Large Cycle Indicator, Matrices of Large Order and Key Exchange Protocols With Nonlinear Polynomial Maps of Small Degree. Math. Comput. Sci. 6(2): 167-180 (2012) - [j19]Michal Klisowski, Vasyl Ustimenko:
On the Comparison of Cryptographical Properties of Two Different Families of Graphs with Large Cycle Indicator. Math. Comput. Sci. 6(2): 181-198 (2012) - [j18]Vasyl Ustimenko, Aneta Wróblewska:
Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography. Ann. UMCS Informatica 12(3): 65-74 (2012) - [j17]Urszula Romanczuk, Vasyl Ustimenko:
On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2. Ann. UMCS Informatica 12(3): 89-106 (2012) - [j16]Monika Polak, Vasyl Ustimenko:
LDPC Codes Based on Algebraic Graphs. Ann. UMCS Informatica 12(3): 107-119 (2012) - [c7]Monika Polak, Vasyl Ustimenko:
On LDPC Codes Corresponding to Infinite Family of Graphs A(k;K). FedCSIS 2012: 567-570 - [c6]Vasyl Ustimenko:
On some mathematical aspects of data protection in cloud computing. HPCS 2012: 84 - 2011
- [j15]Abderezak Touzene, Vasyl Ustimenko, Marwa AlRaissi, Imene Boudelioua:
Performance of algebraic graphs based stream-ciphers using large finite fields. Ann. UMCS Informatica 11(2): 81-93 (2011) - [j14]Vasyl Ustimenko, Aneta Wróblewska:
On the key expansion of D(n, K)-based cryptographical algorithm. Ann. UMCS Informatica 11(2): 95-111 (2011) - [j13]Michal Klisowski, Urszula Romanczuk, Vasyl Ustimenko:
The implementation of cubic public keys based on a new family of algebraic graphs. Ann. UMCS Informatica 11(2): 127-141 (2011) - [j12]Monika Polak, Vasyl Ustimenko:
On LDPC codes corresponding to affine parts of generalized polygons. Ann. UMCS Informatica 11(2): 143-152 (2011) - [j11]Urszula Romanczuk, Vasyl Ustimenko:
On the key exchange with new cubical maps based on graphs. Ann. UMCS Informatica 11(4): 11-19 (2011) - [c5]Vasyl Ustimenko, Stanislaw Kotorowicz, Urszula Romanczuk:
On the implementation of stream ciphers based on a new family of algebraic graphs. FedCSIS 2011: 485-490 - 2010
- [c4]Michal Klisowski, Vasyl Ustimenko:
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings. IMCSIT 2010: 303-308
2000 – 2009
- 2009
- [p1]Vasyl Ustimenko:
On the Cryptographical Properties of Extremal Algebraic Graphs. Algebraic Aspects of Digital Communications 2009: 256-281 - 2008
- [c3]Vasyl Ustimenko:
On the hidden discrete logarithm for some polynomial stream ciphers. IMCSIT 2008: 297-301 - 2003
- [j10]Vasiliy A. Ustimenko, Andrew J. Woldar:
Extremal properties of regular and affine generalized m-gons as tactical configurations. Eur. J. Comb. 24(1): 99-111 (2003) - 2001
- [c2]Vasyl Ustimenko:
CRYPTIM: Graphs as Tools for Symmetric Encryption. AAECC 2001: 278-286
1990 – 1999
- 1999
- [j9]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
Polarities and 2k-cycle-free graphs. Discret. Math. 197-198: 503-513 (1999) - 1997
- [j8]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
New upper bounds on the order of cages. Electron. J. Comb. 4(2) (1997) - 1996
- [j7]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
A characterization of the components of the graphs D(k, q). Discret. Math. 157(1-3): 271-283 (1996) - 1995
- [j6]Felix Lazebnik, Vasiliy A. Ustimenko:
Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size. Discret. Appl. Math. 60(1-3): 275-284 (1995) - [j5]Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar:
Graphs of Prescribed Girth and Bi-Degree. J. Comb. Theory B 64(2): 228-239 (1995) - 1994
- [j4]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
Properties of Certain Families of 2k-Cycle-Free Graphs. J. Comb. Theory B 60(2): 293-298 (1994) - [j3]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles. J. Comb. Theory B 61(1): 111-117 (1994) - 1993
- [j2]Felix Lazebnik, Vasiliy A. Ustimenko:
New Examples of Graphs without Small Cycles and of Large Size. Eur. J. Comb. 14(5): 445-460 (1993) - 1992
- [c1]Felix Lazebnik, Vasiliy A. Ustimenko:
Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size. Expanding Graphs 1992: 75-93
1980 – 1989
- 1989
- [j1]Alexandre A. Ivanov, Mikhail E. Muzichuk, Vasiliy A. Ustimenko:
On a New Family of (P and Q)-polynomial Schemes. Eur. J. Comb. 10(4): 337-345 (1989)
Coauthor Index
Urszula Romanczuk
aka: Urszula Romanczuk-Polubiec
aka: Urszula Romanczuk-Polubiec
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-11-11 22:26 CET 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:
