Base-φ Method for Elliptic Curves over OEF(Special Section on Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
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 F_pm is expected to enhance elliptic curve operation efficiency more than F_q (q is a prime) or F_2n
- 一般社団法人電子情報通信学会の論文
- 2000-04-25