Novel Digital Signature scheme on Non-Commutative Rings using Differential Polynomials in conjugacy problem

Abstract

A method for digital signatures ensures the security of messages sent between individuals. Several algorithms have been developed by focusing on individual challenging issues like conjugacy problem, discrete logarithm problem, and integer factorization problem. Though, it has been noted that these techniques are challenging to calculate in order to get at an appropriate solution.  These days, the majority of algorithms are created by combining two challenging tasks. With a single challenging problem, we created an algorithm that deals comparable security. In this work, we provide a novel digital signature scheme that takes advantage of non-commutative rings characteristics. The digital signature is protected by the hardness of the conjugacy problem on non-commutative structures and also it is designed by using differential polynomials. We believe that conjugacy problem is NP-hard. The confirmation theorem was used to show the algorithm's strength. Security analysis was also explained.