2011•Unpublished venueRequires access

Modified Elgamal Cryptosystem Algorithm (MECA)

Prashant Sharma, Sonal Sharma, Ravi Shankar Dhakar

Open publisher page 17 citations

Abstract

In 1985 a powerful and public-key scheme was produced by ElGamal. ElGamal encryption/decryption algorithm is based on the difficulty of discrete logarithm problem where it is straight forward to raise numbers to large powers but it is much harder to do the inverse computation of the discrete logarithm. Now, there are so many algorithms available which can solve the discrete logarithm problem of small size numbers in a reasonable time. So to improve security, we proposed a Modified ElGamal Cryptosystem Algorithm (MECA) to enhance the security for encrypting long messages and also secure against mathematical and brute-force attack as well as Low-Modulus and Known-Plaintext attack on Elgamal. The security of this algorithm is based on the difficulty of solving the discrete logarithm problem and Integer factorization problem. This paper also presents comparison between MECA and ElGamal cryptosystem in respect of security and complexity.

About this research paper

What this paper is about

In 1985 a powerful and public-key scheme was produced by ElGamal. ElGamal encryption/decryption algorithm is based on the difficulty of discrete logarithm problem where it is straight forward to raise numbers to large powers but it is much harder to do the inverse computation of the discrete logarithm. Now, there are so many algorithms available which can solve the discrete logarithm problem of small size numbers in a reasonable time. So to improve security, we proposed a Modified ElGamal Cryptosystem Algorithm (MECA) to enhance the security for encrypting long messages and also secure against mathematical and brute-force attack as well as Low-Modulus and Known-Plaintext attack on Elgamal. The security of this algorithm is based on the difficulty of solving the discrete logarithm problem and Integer factorization problem. This paper also presents comparison between MECA and ElGamal cryptosystem in respect of security and complexity.

Why it matters

OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In 1985 a powerful and public-key scheme was produced by ElGamal. ElGamal encryption/decryption algorithm is based on the difficulty of discrete logarithm problem where it is straight forward to raise numbers to large powers but it is much harder to do the inverse computation of the discrete logarithm. Now, there are so many algorithms available which can solve the discrete logarithm problem of small size numbers in a reasonable time. So to improve security, we proposed a Modified ElGamal Cryptosystem Algorithm (MECA) to enhance the security for encrypting long messages and also secure against mathematical and brute-force attack as well as Low-Modulus and Known-Plaintext attack on Elgamal. The security of this algorithm is based on the difficulty of solving the discrete logarithm problem and Integer factorization problem. This paper also presents comparison between MECA and ElGamal cryptosystem in respect of security and complexity.

Key concepts: ElGamal encryption, Discrete logarithm, Cryptosystem, Post-quantum cryptography, Plaintext, Computer science, Integer factorization, Encryption

Related papers

Back to paper searchBrowse research topicsOriginal source
Modified Elgamal Cryptosystem Algorithm (MECA) — Research Paper | ScholarLens