International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
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 the user would get the private key too.