Abstract:

In this study, a probabilistic public-key cryptosystem is proposed, based on the conjugacy search problem, which is considered to be computationally hard in non-commutative algebraic structures and has potential applications in public-key cryptography. The construction of the system is presented in detail, highlighting how the underlying algebraic properties contribute to its cryptographic design. Furthermore, a brief cryptanalysis is carried out to evaluate the system's resistance against conventional attack techniques.