default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUrszula Romanczuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j6]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)- [c4]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 - 2018
- [c3]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 - 2014
- [c2]Urszula Romanczuk-Polubiec, Vasyl Ustimenko:
On Multivariate Cryptosystems Based on Polynomially Compressed Maps with Invertible Decomposition. CSS 2014: 23-37 - [i1]Urszula Romanczuk-Polubiec, Vasyl Ustimenko:
On two windows multivariate cryptosystem depending on random parameters. IACR Cryptol. ePrint Arch. 2014: 964 (2014) - 2013
- [j5]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) - [p2]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 - [p1]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 - 2012
- [j4]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) - [j3]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) - 2011
- [j2]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) - [j1]Urszula Romanczuk, Vasyl Ustimenko:
On the key exchange with new cubical maps based on graphs. Ann. UMCS Informatica 11(4): 11-19 (2011) - [c1]Vasyl Ustimenko, Stanislaw Kotorowicz, Urszula Romanczuk:
On the implementation of stream ciphers based on a new family of algebraic graphs. FedCSIS 2011: 485-490
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-05-08 21:43 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:
