Digital signature scheme based on truncated polynomial over finite fields
Maheswara Rao Valluri · 2016
Digital signature scheme is an important cryptosystem for demonstrating the authenticity of a digital message and is used often to implement electronic signatures. This paper proposes a digital signature scheme based on a ring of N-truncated single-variable polynomials over a finite field of prime order. Its security is tied to the twisted ring-root extraction problem over the finite field. We assume that this problem is suitably hard problem to serve as a cryptographic assumption over the platform ring R. It is noted that an adversary cannot forge a signature on a message unless the adversary extracts the twisted eth- root in this ring. The performance and other security issues are also discussed.