12 citations · 28 across the 10 of their papers we have counts for
10 papers
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…
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…
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.
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…
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…
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…
How to make RSA and some other encryptions probabilistic
Vitalii Roman'kov
A new scheme of probabilistic subgroup-related encryption is introduced. Some applications of this scheme based on the RSA, Diffie-Hellman and ElGamal encryption algorithms are des…
Linear decomposition attack on public key exchange protocols using semidirect products of (semi)groups
Vitaliĭ Roman'kov
We show that a linear decomposition attack based on the decomposition method introduced by the author works by finding the exchanged secret keys in all main protocols using semidir…
A linear decomposition attack
Vitaliǐ Roman'kov, Alexei Myasnikov
We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm…
On Rationality of Verbal Subsets In a Group
A. Myasnikov, V. Roman'kov
Let be a free non-abelian group. We show that for any group word the set of all values of in is rational in if and only if or We g…