Implementations of SEA Algorithm Counting the Orders of Elliptic Curve Groups over Binary Fields
Date Issued
2009
Date
2009
Author(s)
Lin, Tzh-Huan
Abstract
The best suggested way to find secure elliptic curves is point-counting. So far Schoof-Elkies-Atkin algorithm (SEA algorithm) is the most efficient point-counting algorithm for elliptic curves over prime fields. Lercier proposed an algorithm to compute isogenies in GF(2^n) such that SEA algorithm can be used for binary case. In this thesis we will follow Lericier''s approach to implement SEA algorithm computing the order of an elliptic curve over binary fields.
Subjects
elliptic curve
group order
SEA algorithm
Schoof algorithm
Elkies prime
Atkin prime
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-98-R94221002-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):007792243944465c37301bb0ac3c2d4d