  There are many group-based cryptosystems in which the security relies on the
difficulty of solving Conjugacy Search Problem (CSP) and Simultaneous Conjugacy
Search Problem (SCSP) in their underlying platform groups. In this paper we
give a cryptanalysis of these systems which use certain semidirect product of
abelian groups.
