A metric on the set of elliptic curves over View the MathML source

Elliptic curves over finite fields have found applications in many areas including cryptography. In the current work we define a metric on the set of elliptic curves defined over a prime field View the MathML sourceFp, p>3p>3. Computing this metric requires us to solve an instance of a discrete log problem in View the MathML sourceFp∗. This idea may have a possible application in devising some cryptographic primitives.