International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
Generally, digital signature algorithms are based on NP-Complete problems like prime factorization problem, discrete logarithm problem, elliptic curve problem etc. The difficulty of RSA digital signature algorithm is based on prime factorization problem. The well known Eth root problem is proved equivalent to prime factorization problem. This paper introduces a new hard number theoretic problem named as Xth root problem. A new variant of digital signature algorithm is also proposed based on Xth root problem.