A reconfigurable processor for high speed point multiplication in elliptic curves
by Nazar A. Saqib, Francisco Rodriguez-Henriquez, Arturo Diaz-Perez
International Journal of Embedded Systems (IJES), Vol. 1, No. 3/4, 2005

Abstract: This paper presents a generic architecture for the computation of elliptic curve scalar multiplication over binary extension fields. In order to optimise the performance as much as we could, we designed a parallelised version of the well-known Montgomery point multiplication algorithm implemented on a reconfigurable hardware platform (Xilinx XCV3200). The proposed architecture allows the computation of the main building blocks required by the Montgomery algorithm in an efficient manner. The results achieved show that our proposed design is able to compute GF(2¹⁹¹) elliptic curve scalar multiplication operations in just 22 clock cycles at a frequency of about 10 MHz. Moreover, our structure is able to obtain a scalar multiplication in less than 60 µSecs.

Online publication date: Mon, 05-Jun-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com