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 2014Show all

1 paper · 1 filter

math.GR2014★ 2 cited

A polynomial time algorithm for the braid double shielded public key cryptosystems

Vitaly Roman'kov

We propose new provable practical deterministic polynomial time algorithm for the braid Wang, Xu, Li, Lin and Wang Double shielded public key cryptosystems. We show that a linear d…