Author(s)

Manoj Kumar, Pratik Gupta

Department of Mathematics and Statistics, Gurukula Kangri Vishwavidyalaya, Haridwar (Uttrakhand), India.

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. The present paper includes the study of two elliptic curve and defined over the ring where . After showing isomorphism between and , we define a composition operation (in the form of a mapping) on their union set. Then we have discussed our proposed cryptographic schemes based on the elliptic curve . We also illustrate the coding of points over E, secret key exchange and encryption/decryption methods based on above said elliptic curve. Since our proposed schemes are based on elliptic curve of the particular type, therefore the proposed schemes provides a highest strength-per-bit of any cryptosystem known today with smaller key size resulting in faster computations, lower power assumption and memory. Another advantage is that authentication protocols based on ECC are secure enough even if a small key size is used.

Elliptic Curve, Ring, Finite Field, Isomorphism, Cardinality, Encryption/Decryption

Kumar, M. and Gupta, P. (2016) Cryptographic Schemes Based on Elliptic Curves over the Ring Zp[i]. Applied Mathematics, 7, 304-312. doi: 10.4236/am.2016.73027.