activity
20092023
most citedPolycyclic, metabelian or soluble of type (FP) groups with boolean algebra of rational sets and biautomatic soluble groups are virtually abelian

5 citations · 23 across the 13 of their papers we have counts for

collaborators
Showing cs.CRShow all

3 papers · 1 filter

cs.CR2022★ 1 cited

Multi-recipient and threshold encryption based on hidden multipliers

Vitaly Roman'kov

Let be a pool of parties and Alice be the dealer. In this paper, we propose a scheme that allows the dealer to encrypt messages in such a way that only one authorized coali…

cs.CR2021

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…

cs.CR2019

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…