期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：11
出版社：S.S. Mishra
摘要：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 signa ture algorithm is based on prime factorization problem. The well known theroot problem is proved equivalent to prime factorization problem. This paper introduces a new hard number theoretic problem named as thxroot problem. A new variant of Digital Signature Algorithm is also proposed based on thxroot problem.
