Title
An end-to-end systems approach to elliptic curve cryptography
Abstract
Abstract. Since its proposal by Victor Miller [17] and Neal Koblitz [15] in the mid 1980s, Elliptic Curve Cryptography (ECC) has evolved into a mature public-key cryptosystem. O ering the smallest key size and the highest strength per bit, its computational e ciency can bene t both client devices and server machines. We have designed a programmable hardware accelerator to speed up point multiplication for elliptic curves over binary polynomial elds GF (2,). The accelerator is based on a scalable architecture capable of handling curves of arbitrary eld de-grees up to m = 255.In addition, it delivers optimized performance for a set of commonly used curves through hard-wired reduction logic. A prototype implementation running in a Xilinx XCV2000E FPGA at 66.4 MHz shows a performance of 6987 point multiplications per second for GF (2,). We have integrated ECC into OpenSSL, today's dominant implementation of the secure Internet protocol SSL, and tested it with the Apache web server and open-source web browsers.
Year
DOI
Venue
2002
10.1007/3-540-36400-5_26
cryptographic hardware and embedded systems
Keywords
Field
DocType
neal koblitz,end-to-end systems approach,programmable hardware accelerator,apache web server,point multiplication,dominant implementation,optimized performance,open-source web browser,prototype implementation,elliptic curve cryptography,server machine,internet protocol,hardware accelerator,elliptic curve
Computer science,Parallel computing,Field-programmable gate array,Cryptosystem,Theoretical computer science,Hardware acceleration,Elliptic curve cryptography,Public-key cryptography,Key size,Elliptic curve,Distributed computing,Web server
Conference
Volume
ISSN
ISBN
2523
0302-9743
3-540-00409-2
Citations 
PageRank 
References 
62
5.76
12
Authors
8
Name
Order
Citations
PageRank
N. Gura1625.76
S. Chang2625.76
H. Eberle3625.76
G. Sumit4625.76
V. K. Gupta59112.72
D. Finchelstein6625.76
E. Goupy7625.76
D. Stebila8625.76