Enhanced RSA Digital Signature Algorithm

Ashish Vijay, Priyanka Trikha, Ashik Hussain


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.

Keywords: xth root; RSA; Factorization; Digital Signature; Cryptanalysis

Full Text:


DOI: https://doi.org/10.26483/ijarcs.v4i3.1590


  • There are currently no refbacks.

Copyright (c) 2016 International Journal of Advanced Research in Computer Science