By Topic

High Performance Elliptic Curve Cryptographic Processor Over GF(2^163)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

In this paper, we propose a high performance elliptic curve cryptographic processor over GF(2163). The proposed architecture is based on a modified Lopez-Dahab elliptic curve point multiplication algorithm and uses Gaussian normal basis (GNB) for GF(2163) field arithmetic. To achieve a high throughput rates, we design two new word- level arithmetic units over GF(2163) and derive a parallelized elliptic curve point doubling and point addition algorithm. We implement our design using Xilinx XC4VLX80 FPGA device which uses 24,263 slices and has a maximum frequency of 143 MHz. Our design is roughly 4.8 times faster with 2 times increased hardware complexity compared with the previous hardware implementation. Therefore, the proposed architecture is well suited to elliptic curve cryptosystems requiring high throughput rates such as network processors and Web servers.

Published in:

Electronic Design, Test and Applications, 2008. DELTA 2008. 4th IEEE International Symposium on

Date of Conference:

23-25 Jan. 2008