700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ ReadersThis Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)
Research Article Open Access
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.
Elliptic curve, Ring, Finite field, Isomorphism, Cardinality, Encryption/Decryption, Smooth Complexities, Adomian Decomposition Method, Applied Mathematics, Number Theory, Sensitivity Analysis, Convection Diffusion Equations, Numerical Solutions, Nonlinear Differential Equations, Differential Transform Method , Balance Law, Quasilinear Hyperbolic Systems, Mixed Initial-boundary Value, Fuzzy Boundary Value, Semi Analytical-Solution, Integrated Analysis, Fuzzy Environments, Molecular Modelling, Fuzzy Quasi-Metric Space, Three Dimensional Steady State, Computational Model