Syllabus
Weierstrass's normal form.
Edwards curves.
Representation by homogeneous coordinates.
Birational equivalence.
Addition on a curve.
Cryptography based on elliptic curves.
Number of points on the curve.
Schoof algorithm.
Choies of a suitable curve.
Curve factoring.
Annotation
The course describes basic properties of eliptic curves over finite fields with regard to their use in cryptography.