The height function and the elliptic curve discrete logarithm problem

Ming-Deh Huang
University of Southern California
Computer Science

From the inception of elliptic curve cryptography it has been suggested that the height function on elliptic curves provides a barrier to solving the elliptic curve discrete logarithm problem. The purpose of this talk is to examine this issue in light of some recent developments.

Audio (MP3 File, Podcast Ready) Presentation (PDF File)

Back to Workshop I: Number Theory and Cryptography - Open Problems