Kusmus, Omer2025-11-302025-11-3020251814-04241814-043210.69793/ijmcs/04.2025/kusmushttps://doi.org/10.69793/ijmcs/04.2025/kusmushttps://hdl.handle.net/20.500.14720/29000In 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.eninfo:eu-repo/semantics/openAccessConjugacy Search ProblemGroup RingNon-CommutativeUnitPublic Key CryptosystemProbabilisticArticle204N/AQ410131019WOS:001615229000005