We first describe elliptic curves and their arithmetic. Then we introduce the discrete logarithm problem and its implications in cryptographic protocols, such as the Diffie-Helman key agreement and the signatures DSA and ECDSA. The most important general attacks on the discrete logarithm problem are also studied, with an emphasis on those that work in the group of points on an elliptic curve, i.e., the giant step-baby step algorithm and the Pollard's rho algorithm together with the Floyd's algorithm for cycle detection.
Our application for interactive representation of elliptic curves and their arithmetic is also described. It is divided into two smaller applications. The first focuses on elliptic curves over real numbers and the second one on prime fields.
|
