New Digital Signature scheme on Non-Commutative Rings using Double Conjugacy

Abstract

Digital signature algorithm provides a security of a message which is transferred from one person to another person. Many algorithms have been designed by taking single hard problems like Discrete logarithm problem, Integer factorization problem, Conjugacy problem, however, it has been observed that above algorithms are hard to compute towards finding a proper solution. Nowadays most of the algorithms are designed by combination of two hard problems. We designed an algorithm to provide equivalent security with one hard problem. In this article we designed a new digital signature scheme based on the Conjugacy problem in non-commutative rings. Initially we presented a signature scheme by using double Conjugacy over non-commutative rings. The strength of the algorithm was demonstrated using the confirmation theorem and further security analysis has been performed.

URN: NBN:sciencein.jist.2023.v11.471