Syllabus
Arithmetic of elliptic curves (Weierstrass equation, isomorphisms and endomorphisms, invariants, chord and tangent process), influence of characteristics, division polynomials, Weil pairing). Effective implementation (addition and multiplication of points, Frobenius expansion, compression of points).
Algorithmic complexity of elliptic curves. Schoof algorithm and its extensions.
Annotation
The course introduces into arithmetics of elliptic curves, to its implementation and to concrete algorithms and cryptosystems based on elliptic curves. It is assumed that the student is familiar with basic concepts of algebraic geometry (say, in the extent of the course "Algebraic geometry in positive characteristic").