Adaptation of a Cryptosystem Based on the Arithmetic of Finite Fields to Elliptic Curves
In this paper, we present an encryption and decryption scheme based on the use of the discrete logarithm problem in elliptic curves. Our Cryptosystem is inspired from Harn and Yang work. We show that the method is as secure as the ElGamal equivalent, and has a 1:1 expansion ratio. We also analyze the protocol security, discuss its running time and give a numerical example.
Public key cryptography; discrete logarithm problem; elliptic curves