Parallelized Scalar Multiplication on Elliptic Curves Defined over Optimal Extension Field

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 508
  • Download : 1
In this paper, we propose three algorithms to perform scalar multiplication on elliptic curves defined over higher characteristic finite fields such as the OEF (Optimal Extension Field). First, we propose an efficient scalar multiplication method in which the Frobenius expansion is used on an elliptic curve defined over OEF. Second, we propose a new finite field multiplication algorithm. Third, we propose a particular polynomial squaring algorithm. We show that the proposed algorithms, when used together, accelerate the scalar multiplication on elliptic curves by two-fold.
Publisher
Femto Technique Co., LTD
Issue Date
2007-01
Language
English
Citation

INTERNATIONAL JOURNAL OF NETWORK SECURITY, v.4, no.1, pp.99 - 106

ISSN
1816-3548
URI
http://hdl.handle.net/10203/13726
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0