Modified ElGamal over RSA Digital Signature Algorithm (MERDSA)

Main Article Content

Kapil Madhur
Ruchi Patira


Generally digital signature algorithms are based on a single hard problem like prime factorization problem, discrete logarithm
problem, 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. There are many other algorithms which are based on
the hybrid combination of prime factorization and discrete logarithms problem but different weaknesses and attacks have been developed
against those algorithms. This paper also presents a new variant of digital signature algorithm which is based on two hard problems,
prime factorization and discrete logarithm.

Keyword-Digital Signature; Discrete logarithm; Factorization; Cryptanalysis


Download data is not yet available.

Article Details