This document discusses elliptic curve cryptography and defines some key concepts. It provides an example of a private key, public key, and generator point G for an elliptic curve. It then gives an example of finding the first 20 points on the elliptic curve y2=x3+7 modulo a prime number 38047. Finally, it states that in general, an elliptic curve is defined as y2=x3+ax+b modulo a prime number p.