We present a basic introduction to elliptic curve cryptography.
We show how to build an elliptic curve cryptosystem, from
defining various operations on elliptic curve groups, via describing
the classical and elliptic discrete logarithm problems, to the selection of the
underlying finite fields. We also describe the state of current
research in the field and why elliptic curve cryptography is
sometimes favored over RSA-based schemes.