activity
20032005
most citedCombinatorial group theory and public key cryptography

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

collaborators

6 papers

math.GR2005

Densities in free groups and , Visible Points and Test Elements

Ilya Kapovich, Igor Rivin, Paul Schupp +1

In this article we relate two different densities. Let be the free group of finite rank and let be the abelianization map from onto . We pr…

math.GR20042 cited

Combinatorial group theory and public key cryptography

Vladimir Shpilrain, Gabriel Zapata

After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that the conjugac…

math.GR2004

Translation equivalence in free groups

Ilya Kapovich, Gilbert Levitt, Paul Schupp +1

Motivated by the work of Leininger on hyperbolic equivalence of homotopy classes of closed curves on surfaces, we investigate a similar phenomenon for free groups. Namely, we study…

math.AG2004

Test polynomials, retracts, and the Jacobian conjecture

Vladimir Shpilrain, Jie-Tai Yu

Let K[x,y] be the algebra of two-variable polynomials over a field K. A polynomial p=p(x, y) is called a test polynomial (for automorphisms) if, whenever ϕ(p)=p for a mapping ϕof K…

math.GR2003

On the palindromic and primitive widths of a free group

Valery Bardakov, Vladimir Shpilrain, Vladimir Tolstykh

Let G be a group and S a subset of G that generates G. For each x in G define the length l_S(x) of x relative to S to be the minimal k such that x is a product of k elements of S.…

math.GR20032 cited

Assessing security of some group based cryptosystems

Vladimir Shpilrain

One of the possible generalizations of the discrete logarithm problem to arbitrary groups is the so-called conjugacy search problem (sometimes erroneously called just the conjugacy…