default search action
Vitalii Roman'kov
Person information
- unicode name: Романьков
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j12]Vitaly Roman'kov
:
An improvement of the Diffie-Hellman noncommutative protocol. Des. Codes Cryptogr. 90(1): 139-153 (2022) - [i7]Vitaly Roman'kov:
Multi-recipient and threshold encryption based on hidden multipliers. CoRR abs/2210.06889 (2022) - 2021
- [i6]Vitaly Roman'kov:
Multiparty secret sharing based on hidden multipliers. CoRR abs/2108.06967 (2021)
2010 – 2019
- 2019
- [j11]Vitalii Roman'kov
An improved version of the AAG cryptographic protocol. Groups Complex. Cryptol. 11(1): 35-41 (2019) - [i5]Vitalii Roman'kov:
Cryptanalysis of two schemes of Baba et al. by linear algebra methods. CoRR abs/1910.09480 (2019) - [i4]Vitaly Roman'kov:
Cryptanalysis of a new version of the MOR scheme. CoRR abs/1911.00895 (2019) - 2018
- [j10]Vitaly Roman'kov
Two general schemes of algebraic cryptography. Groups Complex. Cryptol. 10(2): 83-98 (2018) - [i3]Vitalii Roman'kov:
Cryptographic analysis of the Modified Matrix Modular Cryptosystem. CoRR abs/1811.09876 (2018) - 2017
- [j9]Vitalii Roman'kov
Cryptanalysis of a combinatorial public key cryptosystem. Groups Complex. Cryptol. 9(2): 125-135 (2017) - 2016
- [j8]Vitalii Roman'kov
A nonlinear decomposition attack. Groups Complex. Cryptol. 8(2): 197-207 (2016) - [i2]Vitalii Roman'kov:
How to make RSA and some other encryptions probabilistic. CoRR abs/1603.02031 (2016) - 2015
- [j7]Alexei G. Myasnikov
A linear decomposition attack. Groups Complex. Cryptol. 7(1): 81-94 (2015) - [j6]Vitalii Roman'kov:
New probabilistic public-key encryption based on the RSA cryptosystem. Groups Complex. Cryptol. 7(2): 153-156 (2015) - [i1]Vitalii Roman'kov:
Linear decomposition attack on public key exchange protocols using semidirect products of (semi)groups. CoRR abs/1501.01152 (2015) - 2014
- [j5]Alexei G. Myasnikov, Vitalii Roman'kov:
Diophantine cryptography in free metabelian groups: Theoretical base. Groups Complex. Cryptol. 6(2): 103-120 (2014) - 2013
- [j4]Alexei G. Myasnikov
On Rationality of Verbal Subsets in a Group. Theory Comput. Syst. 52(4): 587-598 (2013) - 2012
- [j3]Vitalii Roman'kov
Equations over groups. Groups Complex. Cryptol. 4(2): 191-239 (2012) - 2011
- [j2]Robert H. Gilman, Alexei G. Myasnikov
Random equations in free groups. Groups Complex. Cryptol. 3(2): 257-284 (2011)
2000 – 2009
- 2008
- [j1]Vitaly Roman'kov
On the Automorphism Group of a Free Metabelian Lie Algebra. Int. J. Algebra Comput. 18(2): 209-226 (2008)
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 21:19 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: