Integration of a Conjugacy over Non-Commutative Ring in Digital Signature Mechanism

Digital signatures are typically dependent on complex mathematical operations like the integer factorization problem, conjugacy problem, and DLP. Nowadays, most of the algorithms are based on a combination of two hard mathematical problems. To enhance the security and provide equivalent security with single hard problem, a new scheme has been proposed. The proposed algorithm is developed by using a conjugacy problem, as the conjugacy structure is intractable on non-commutative rings. Initially, the digital signature algorithm is designed and then it is integrated with a confirmation theorem. Finally, the security analysis of the proposed algorithm is explained.