Cryptanalysis of protocols using (Simultaneous) Conjugacy Search Problem in certain Metabelian Platform Groups

TL;DR

This paper analyzes the security of group-based cryptosystems relying on the difficulty of CSP and SCSP in certain semidirect product groups, revealing potential vulnerabilities through cryptanalysis.

Contribution

It provides a cryptanalysis of cryptosystems based on semidirect products of abelian groups, highlighting security concerns.

Findings

Cryptanalysis demonstrates vulnerabilities in certain group-based cryptosystems.

Security relies heavily on the difficulty of CSP and SCSP in specific groups.

Potential for cryptanalysis reduces confidence in some existing protocols.

Abstract

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.