To search, Click below search items.


All Published Papers Search Service


New Digital Signature Scheme Using Polynomials Over Non-Commutative Groups


P. Vasudeva Reddy, G.S.G.N.Anjaneyulu, D.V. Ramakoti Reddy, M.Padmavathamma


Vol. 8  No. 1  pp. 245-250


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. In this paper, we propose a new Digital signature scheme based on general non-commutative group. The key idea of our scheme is that for a given non-commutative group, we define polynomials and take them as the underlying work stricture. By doing so, we implement a digital signature scheme. The security of the proposed signature scheme is based on the intractability of the Polynomial Symmetrical Decomposition Problem over the given non-commutative group.


Public Key Cryptography, Digital Signatures, Polynomial rings, non-commutative groups, Decomposition problem, Diffie-Hellman problem.