Název:
Schoofův algoritmus pro Weierstrassovy křivky
Překlad názvu:
Schoof's algorithm for Weierstrass curves
Autoři:
Zvoníček, Václav ; Drápal, Aleš (vedoucí práce) ; Mareš, Martin (oponent) Typ dokumentu: Bakalářské práce
Rok:
2023
Jazyk:
eng
Abstrakt: Schoof's algorithm is the starting point for the most efficient methods for determining the number of rational points on an elliptic curve defined over a finite field. The goal of this thesis is to introduce the subject of elliptic curves, with the emphasis on Weierstrass curves over a finite field, to describe Schoof's algorithm and its time complexity, and, finally, to implement it in C++ with the support of NTL. The implementation provides a user with a reasonably fast utility for determining the order of Weierstrass curves over finite fields of size up to 128 bits. 1
Klíčová slova:
eliptická křivka|Weierstrassova křivka|Hasseho věta|dělící polynom|Schoofův algoritmus; elliptic curve|Weierstrass curve|Hasse's theorem|division polynomial|Schoof's algorithm