Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic

@inproceedings{Kobayashi1999FastEC,
  title={Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic},
  author={Tetsutaro Kobayashi and Hikaru Morita and Kunio Kobayashi and Fumitaka Hoshino},
  booktitle={EUROCRYPT},
  year={1999}
}
A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the troughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on base-φ expansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base field Fpm is expected to enhance elliptic curve operation efficiency more than Fq (q is a prime) or F2n . 
29 Citations
14 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…