“…That means cryptographer elliptic curve is in the form y 2 mod p = (x 3 + ax + b) mod p where 4a 3 + 27b 2 ≠ 0 and p is a prime number and a, b is the parameter of the curve, here variables and coefficient are all restricted to elements of a finite field. There are two families of elliptic curve are used in cryptography application [8,9,10]. In Elliptic curves defined over GF (2 m ), the variables and co-efficient all take on values in GF (2 m ) and in calculation performed over GF (2 m ).…”