Counting the points on elliptic curves over finite fields
Počítání bodů na eliptických křivkách nad konečnými tělesy
bachelor thesis (DEFENDED)
View/ Open
Permanent link
http://hdl.handle.net/20.500.11956/101749Identifiers
Study Information System: 201796
Collections
- Kvalifikační práce [11972]
Author
Advisor
Referee
Stanovský, David
Faculty / Institute
Faculty of Mathematics and Physics
Discipline
Mathematical Methods of Information Security
Department
Department of Algebra
Date of defense
12. 9. 2018
Publisher
Univerzita Karlova, Matematicko-fyzikální fakultaLanguage
English
Grade
Excellent
Keywords (Czech)
Schoofov algoritmus, eliptická krivka, deliaci polynóm, Frobeniov endomorfizmusKeywords (English)
Schoof's algorithm, Elliptic curve, Division polynomial, Frobenius endomorphismCieľom tejto práce je vysvetliť a naimplementovať Schoofov algoritmus na počítanie bodov na eliptických krivkách nad konečnými telesami. Začneme definíciou eliptickej krivky ako množiny bodov spĺňajúcich istú rovnicu a pokračujeme definovaním operácie na tejto množine. Teoretické poznatky potrebné k algoritmu sú predstavené v druhej kapitole. Napokon je prestavený Schoofov algoritmus v tretej kapitole, doplnený o implementáciu v SageMath open-source software.
The goal of this thesis is to explain and implement Schoof's algorithm for counting points on elliptic curves over finite fields. We start by defining elliptic curve as a set of points satisfying certain equation and then proceeding to define an operation on this set. Theoretical background needed for the algorithm is presented in the second chapter. Finally, the Schoof's algorithm is introduced in the third chapter, supplemented by an implementation in SageMath open-source software.
