From the discrete logarithm problem for curves to the computation of special linear systems

We consider the discrete logarithm problem of non-hyperelliptic curves. Observing that the computation can be sped up with the computation of special linear systems, we turn to the efficient computation of these. We then explore several techniques to do so. Finally, we come back to the discrete logarithm problem and present some theorems for curves of a fixed genus.