In this master thesis, we talk about the discrete logarithm on an elliptic curve, and this is a reorganization of M-O-V's, Semaev's, and Voloch's papers. Let E be an elliptic curve over a finite field F and char(F)=p, the discrete logarithm problem on an elliptic curve is to compute an integer m such that Q=[m]P, where P and Q are rational points on E. If P has order n, we consider two cases: (1)gcd(n,p)=1 (2)gcd(n,p) is not 1 Finally, we can use the Chinese remainder theorem to compute m