Visser, J (2020) Schoof's algorithm: Point counting on elliptic curves. Bachelor's Thesis, Mathematics.
|
Text
bMATH_2020_VisserJ.pdf Download (478kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
toestemming.pdf Restricted to Registered users only Download (98kB) |
Abstract
Elliptic curves are smooth projective algebraic curves of genus 1. The points of an elliptic curve form a group; over a finite field F_p this group is finite. Elliptic curves are widely used in cryptography; these crypto systems are based on the difficulty of the discrete logarithm problem (DLP) for the group consisting of all rational points of elliptic curves defined over the field F_p. Determining the size of this group is an important step in testing the difficulty of elliptic curve DLP. René Schoof in 1985 introduced an algorithm, which counts points on elliptic curves over finite fields. In this thesis, we will go over the general theory of elliptic curves and discuss how this knowledge is incorporated into Schoof's algorithm.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Kilicer, P. and Muller, J.S. |
| Degree programme: | Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 28 Feb 2020 11:47 |
| Last Modified: | 28 Feb 2020 11:47 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/21605 |
Actions (login required)
 |
View Item |