New Digital Signature Scheme Using Polynomials Over Non-Commutative Groups

Digital signatures are probably the most important and widely used cryptographic primitive enabled by public key technology, and they are building blocks of many modern distributed computer applications, like, electronic contract signing, certified email, and secure web browsing etc. However, many existing signatures schemes lie in the intractability of problems closure to the number theory than group theory. This paper proposes a new Digital signature scheme based on general non-commutative group. The key idea of scheme is that for a given non-commutative group, it defines polynomials and takes them as the underlying work stricture.