Differential polynomials on Non-Commutative Rings in Digital Signature scheme

Abstract

In general, digital signatures are based on difficult mathematical problems such as the discrete logarithmic problem, the Conjugacy problem, and the Integer factorization problem. In this article, authors propose a novel digital signature scheme using differential polynomials in Conjugacy problem over non-commutative structures. Initially, an algorithm on non-commutative rings in digital signatures have been generated and proved the confirmation theorem for the proposed algorithm. Finally, the signature algorithm has been evaluated for the security analysis.

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