Oskar Eklund: Counting points on elliptic curves - A study of Schoof's algorithm
Tid: To 2018-01-25 kl 14.00 - 15.00
Plats: Room 35, House 5, Kräftriket, Department of Mathematics, Stockholm University
Respondent: Oskar Eklund (BSc student)
Handledare: Jonas Bergström
Abstract: An elliptic curve over a field is a set of points with an addition operation defined, making it a group. The points are determined by a so called "weierstrass equation".
In this paper we will consider these elliptic curves over finite fields, this will make the sets of points finite, and study ways of counting the number of points on a given elliptic curve. The main algorithm for counting points on elliptic curve that we will study is Shoof's algorithm, but we will also consider some other less efficient algorithms and methods of counting points on elliptic curves over finite fields.