Fast Arithmetic for Elliptic Curve over GF(2^n)
| Autor: | Yi-Shung Chen, 陳奕勛 |
|---|---|
| Rok vydání: | 2004 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 92 Calculation of multiples of elliptic points plays a central role in elliptic curve public-key cryptosystems. In this thesis, a fast doubling arithmetic in affine coordinates is proposed for elliptic curves over GF(2^n). The proposed fast arithmetic speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications, when one computes 2^k P (k≧2) with a given point P on the curve. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|