4 citations · 9 across the 6 of their papers we have counts for
8 papers
Undecidability of the submonoid membership problem for a sufficiently large finite direct power of the Heisenberg group
Vitaly Roman'kov
The submonoid membership problem for a finitely generated group is the decision problem, where for a given finitely generated submonoid of and a group element it is…
Multiparty secret sharing based on hidden multipliers
Vitaly Roman'kov
Secret sharing schemes based on the idea of hidden multipliers in encryption are proposed. As a platform, one can use both multiplicative groups of finite fields and groups of inve…
Embedding theorems for solvable groups
Vitaly Roman'kov
In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group lying in a variety ${\ma…
The stabilizer of a column in a matrix group over a polynomial ring
Vitaly Roman'kov
An original non-standard approach to describing the structure of a column stabilizer in a group of matrices over a polynomial ring or a Laurent polynomial ring of …
Cryptanalysis of a new version of the MOR scheme
Vitaly Roman'kov
We show that an attack based on the linear decomposition method introduced by the author can be efficiently applied to the new version of the MOR scheme proposed in \cite{BMSS}. We…
A general encryption scheme using two-sided multiplications with its cryptanalysis
V. A. Roman'kov
We show that many known schemes of the public key exchange protocols in the algebraic cryptography, that use two-sided multiplications, are the specific cases of the general scheme…