Implementation of elliptic curve cryptosystems over GF (2 n ) in optimal normal basis on a reconfigurable computer (2004)
| Venue: | 14th International Conference on Field Programmable Logic and Applications - FPL’04 |
| Citations: | 7 - 2 self |
BibTeX
@INPROCEEDINGS{Bajracharya04implementationof,
author = {Sashisu Bajracharya and Chang Shu and Kris Gaj and Tarek El-ghazawi},
title = {Implementation of elliptic curve cryptosystems over GF (2 n ) in optimal normal basis on a reconfigurable computer},
booktitle = {14th International Conference on Field Programmable Logic and Applications - FPL’04},
year = {2004},
pages = {1001--1005},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Reconfigurable Computers are general-purpose high-end computers based on a hybrid architecture and close system-level integration of traditional microprocessors and Field Programmable Gate Arrays (FPGAs). In this paper, we present an application of reconfigurable computers to developing a lowlatency implementation of Elliptic Curve Cryptosystems, an emerging class of public key cryptosystems used in secure Internet protocols, such as IPSec. An issue of partitioning the description between C and VHDL, and the associated trade-offs are studied in detail. End-to-end speed-ups in the range of 895 to 1300 compared to the pure microprocessor execution time are demonstrated. 1
