Cryptographic Schemes Based on Elliptic Curves over the Ring Zp[i]

Journal of Applied & Computational Mathematics

article

Kumar M¹  Gupta P¹ 

[1] Department of mathematics and Statistics

关键词: Elliptic curve;    Ring;    Finite field;    Isomorphism;    Cardinality;    Encryption/Decryption;   

DOI  :  10.4172/2168-9679.1000288

来源: Hilaris Publisher

【 摘 要 】

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 Ea,b and Ea,-b defined over the ring Zp[i] where i2 = -1. After showing isomorphism between Ea,b and Ea,-b. 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 E = Ea,b∪Ea,-b. 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 scheme 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.

【 授权许可】

Unknown