A cryptographic processor for arbitrary elliptic curves over GF(2^m)
by Hans Eberle, Nils Gura, Sheueling Chang Shantz, Vipul Gupta
International Journal of Embedded Systems (IJES), Vol. 3, No. 4, 2008

Abstract: We describe a cryptographic processor for Elliptic Curve Cryptography (ECC). The processor performs point multiplication for elliptic curves over binary polynomial fields GF(2^m) up to a field degree of 255. In contrast to other designs that only support one curve at a time, our processor is capable of handling arbitrary curves. We have implemented the cryptographic processor in a Field-Programmable Gate Array (FPGA) running at a clock frequency of 66.4 MHz. Its performance is 6955 point multiplications per second for named curves over GF(2¹⁶³) and 3308 point multiplications per second for generic curves over GF(2¹⁶³).

Online publication date: Sat, 03-Jan-2009

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