Elliptic Curves

Abstract

In recent years a topic in number theory and algebraic geometry — elliptic curves (more precisely, the theory of elliptic curves defined over finite fields) — has found application in cryptography. The basic reason for this is that elliptic curves over finite fields provide an inexhaustible supply of finite abelian groups which, even when large, are amenable to computation because of their rich structure. Before (§ IV.3) we worked with the multiplicative groups of fields. In many ways elliptic curves are natural analogs of these groups; but they have the advantage that one has more flexibility in choosing an elliptic curve than in choosing a finite field.KeywordsElliptic CurveFinite FieldElliptic CurfPrime DivisorMultiple RootThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.