期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：10
出版社：S.S. Mishra
摘要：Generally, digital signature algorithms are based on a single hard problem like prime factorization problem or discrete logarithm problem or elliptic curve problem. If one finds solution of this single hard problem then these digital signature algorithms will no longer be secured and due to large computational power, this may be possible in future. The RSA digital signature algorithm (RSADSA) is an asymmetric cryptographic technique, whose security is related to the difficulty of factorization. But if one would solve the factorization problem then he would get the private key too. RSADSA is not only vulnerable to the prime factorization attacks but also to the small private exponent d and small public exponent e attacks. So to improve security, this paper presents a new variant of digital signature algorithm which is based on two hard problems, prime factorization and xth root problem. The proposed algorithm is a modification of the RSA digital signature algorithm.
关键词：xth root; RSA; Factorization; Digital Signature; Cryptanalysis
