International Association
for Cryptologic Research

In this paper we cryptanalyze two protocols: Grigoriev-Shpilrain

authentication protocol and Wang et al. public key encryption protocols

that use computational hardness of some variations of the conjugacy search problem

in noncommutative monoids. We devise a practical heuristic algorithm

solving those problems.

As a conclusion we claim that these protocols are insecure for the proposed parameter values.