Strength of RSA lies in integer factorization problem. That is when the authors are given a number n; they have to find its prime factors. It becomes quite complicated when dealing with large numbers. RSA (Rivest, Shamir and Adleman) is being used as a public key exchange and key agreement tool for many years. Due to large numbers involved in RSA, there is need for more efficient methods in implementation for public key cryptosystems. Elliptic Curve Cryptography (ECC) is based on elliptic curves defined over a finite field. Elliptic Curve Cryptosystems (ECC) was discovered by the researchers.