碩士 / 國立臺灣大學 / 數學研究所 / 97 / 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.
| Identifer | oai:union.ndltd.org:TW/097NTU05479004 |
| Date | January 2009 |
| Creators | Tzh-Huan Lin, 林子桓 |
| Contributors | Jiun-Ming Chen, 陳君明 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | en_US |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 73 |
Page generated in 0.0156 seconds