Share Email Print

Proceedings Paper

An efficient hardware architecture of a scalable elliptic curve crypto-processor over GF(2n)
Author(s): Lo'ai Tawalbeh; Alexandre Tenca; Song Park; Cetin Koc
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper presents a scalable Elliptic Curve Crypto-Processor (ECCP) architecture for computing the point multiplication for curves defined over the binary extension fields (GF(2n)). This processor computes modular inverse and Montgomery modular multiplication using a new effcient algorithm. The scalability feature of the proposed crypto-processor allows a fixed-area datapath to handle operands of any size. Also, the word size of the datapath can be adjusted to meet the area and performance requirements. On the other hand, the processor is reconfigurable in the sense that the user has the ability to choose the value of the field parameter (n). Experimental results show that the proposed crypto-processor is competitive with many other previous designs.

Paper Details

Date Published: 17 September 2005
PDF: 11 pages
Proc. SPIE 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV, 59100Q (17 September 2005); doi: 10.1117/12.615975
Show Author Affiliations
Lo'ai Tawalbeh, Jordan Univ. of Science and Technology (Jordan)
Alexandre Tenca, Synopsys Inc. (United States)
Song Park, Oregon State Univ. (United States)
Cetin Koc, Oregon State Univ. (United States)

Published in SPIE Proceedings Vol. 5910:
Advanced Signal Processing Algorithms, Architectures, and Implementations XV
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top