Kusmu, O.2025-11-302025-11-3020251814-042410.69793/ijmcs/04.2025/kusmus2-s2.0-105024108266https://doi.org/10.69793/ijmcs/04.2025/kusmusIn this study, a probabilistic public-key cryptosystem is proposed, based on the conjugacy search problem, which is considered to be com- putationally 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. Further- more, a brief cryptanalysis is carried out to evaluate the system’s resistance against conventional attack techniques. © (2025), (Badih/Ghusayni, Ed. & Pub.). All rights reserved.eninfo:eu-repo/semantics/openAccessConjugacy Search ProblemGroup RingNon-CommutativeProbabilisticPublic Key CryptosystemUnitArticle