Highly Influenced

# 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} }

- Published 1999 in EUROCRYPT
DOI:10.1007/3-540-48910-X_13

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 .

#### From This Paper

##### Figures, tables, and topics from this paper.

29 Citations

14 References

Similar Papers