Application of message embedding technique in ElGamal Elliptic Curve Cryptosystem

The use of elliptic curve for public key cryptosystem has been developed almost twenty years ago. The strength of the elliptic curve cryptosystem relies on the elliptic curve discrete logarithm problem (ECDLP). In this paper, a method of embedding plaintexts to points on the elliptic curve is proposed. The method deploys elliptic curve based on encryption and decryption processes by using the two protocols, the ElGamal Elliptic Curve Cryptosystem. Maple 10 is used to determine and compute points on the elliptic curves as well as to compute the addition and scalar multiplication operations using the proposed method.

[1]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[2]  Alfred Menezes,et al.  Elliptic Curve Discrete Logarithm Problem , 2005, Encyclopedia of Cryptography and Security.

[3]  Alfred Menezes,et al.  Elliptic curve cryptosystems and their implementation , 1993, Journal of Cryptology.

[4]  N. Koblitz Elliptic curve cryptosystems , 1987 .

[5]  Joseph H. Silverman,et al.  The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.

[6]  A. Enge,et al.  Elliptic Curves and Their Applications to Cryptography , 1999, Springer US.

[7]  Neal Koblitz,et al.  A course in number theory and cryptography, Second Edition , 1994 .

[8]  Andreas Enge,et al.  Elliptic Curves and Their Applications to Cryptography , 1999, Springer US.

[9]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.