activity
20162019
most citedOn verbally closed subgroups of free solvable groups

1 citations · 1 across the 4 of their papers we have counts for

collaborators

7 papers

cs.CR2019

Cryptanalysis of two schemes of Baba et al. by linear algebra methods

V. Roman'kov

We show that the attacks based on the linear decomposition method introduced by the author and the span-method introduced by Tsaban allow one to find the transmitted message in the…

math.GR20191 cited

On verbally closed subgroups of free solvable groups

V. A. Roman'kov, E. I. Timoshenko

We study verbally closed subgroups of free solvable groups. A number of results is proved that give sufficient conditions under whose a verbally closed subgroup is turned to be a r…

math.GR2019

Two-generated verbally closed subgroups of a free solvable group G are retracts of G

V. A. Roman'kov, E. I. Timoshenko

We prove that every verbally closed two-generated subgroup of a free solvable group G of a finite rank is a retract of G.

cs.CR2018

Cryptographic analysis of the Modified Matrix Modular Cryptosystem

Vitaliĭ Roman'kov

We show that the Modified Matrix Modular Cryptosystem proposed by S.K. Rososhek is not secure against the attack based on the linear decomposition method. The security of the encry…

math.GR2018

Automorphism groups of relatively free groups of infinite rank: a survey

V. Roman'kov

The paper is intended to be a survey on some topics within the framework of automorphisms of a relatively free groups of infinite rank. We discuss such properties as tameness, prim…

math.GR2017

On linearity of automorphism groups of algebras and groups

Vitalii Roman'kov

The main purpose of this paper is to describe some published results and outline corresponding approaches which when applied to automorphism groups of algebras or groups establish…