9 citations · 25 across the 6 of their papers we have counts for
5 papers · 1 filter
The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable
I. Lysenok, A. Myasnikov, A. Ushakov
In this paper we prove that the Conjugacy Problem in the Grigorchuk group has polynomial time complexity.
An authentication scheme based on the twisted conjugacy problem
Vladimir Shpilrain, Alexander Ushakov
The conjugacy search problem in a group is the problem of recovering an from given and . The alleged computational hardness of this problem in s…
Cryptanalysis of Anshel-Anshel-Goldfeld-Lemieux key agreement protocol
Alex D. Myasnikov, Alexander Ushakov
The Anshel-Anshel-Goldfeld-Lemieux (abbreviated AAGL) key agreement protocol is proposed to be used on low-cost platforms which constraint the use of computational resources. The c…
Cryptanalysis of shifted conjugacy authentication protocol
Jonathan Longrigg, Alexander Ushakov
In this paper we present the first practical attack on the shifted conjugacy-based authentication protocol proposed by P. Dehornoy. We discuss the weaknesses of that primitive and…
Random subgroups and analysis of the length-based and quotient attacks
Alexei G. Myasnikov, Alexander Ushakov
In this paper we discuss generic properties of "random subgroups" of a given group G. It turns out that in many groups G (even in most exotic of them) the random subgroups have a s…