Abstract
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 F p , p > 3 . Computing this metric requires us to solve an instance of a discrete log problem in F p ∗ . This idea may have a possible application in devising some cryptographic primitives.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
