Implementation of ElGamal Elliptic Curve Cryptography over prime field using C

Elliptic Curve Cryptography recently gained a lot of attention in industry. The principal attraction of ECC compared to RSA is that it offers equal security for a smaller key size, thereby reducing processing overhead. There is no sub exponential time algorithm in solving the Elliptic curve discrete logarithm problem. ElGamal Elliptic Curve Cryptography is a public key cryptography analogue of the ElGamal encryption schemes which uses Elliptic Curve Discrete Logarithm Problem. The ElGamal Elliptic Curve Cryptosystem is implemented using C language in our work. We divided the whole cryptosystem into seven different phases. The paper also describes different efficient algorithms used in the implementation to perform various mathematical manipulations.