Many cryptographic applications are based
on the discrete logarithm.

Important example: DLOG on elliptic
curves.

Is it always equally hard? Are there “good curves”
and “bad
curves”?

Mathematical content: proof/techniques
use

•Elliptic Curves

•Expander Graphs

•Modular Forms

•L-functions

•Generalized Riemann Hypothesis

Brief
Overview