The purpose of this thesis is an in-depth examination of the Elliptic Curve Discrete Logarithm Problem(ECDLP) including up-to-date techniques in attacking cryptosystems dependent on the ECDLP. The thesis is presented as a how-to guide and included are programs written in Pari/GP for various attacks. We then use the knowledge of these attacks in an attempt to generate cryptographically strong elliptic curves.
Matthew Musson (Sun,) studied this question.