Base-φ Method for Elliptic Curves over OEF
Summary :
A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the throughput 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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.4 pp.679-686
- Publication Date
- 2000/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tetsutaro KOBAYASHI, "Base-φ Method for Elliptic Curves over OEF" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 4, pp. 679-686, April 2000, doi: .
Abstract: A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the throughput 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_4_679/_p
Copy
@ARTICLE{e83-a_4_679,
author={Tetsutaro KOBAYASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Base-φ Method for Elliptic Curves over OEF},
year={2000},
volume={E83-A},
number={4},
pages={679-686},
abstract={A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the throughput 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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Base-φ Method for Elliptic Curves over OEF
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 679
EP - 686
AU - Tetsutaro KOBAYASHI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2000
AB - A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the throughput 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.
ER -
English
