We will discuss how to compute the number of solutions in a finite field F_p to a cubic plane curve. Naive counting is much too slow, especially for cryptography applications (where p could be chosen so large that there are more solutions than atoms in the visible universe).

We will discuss elliptic curves and an algorithm of Schoof. We will reduce the problem of counting to computing traces of certain matrices arising from Frobenius actions.