×

An end-to-end systems approach to elliptic curve cryptography. (English) Zbl 1020.94519

Kaliski, Burton S. jun. (ed.) et al., Cryptographic hardware and embedded systems - CHES 2002. 4th international workshop, Redwood Shores, CA, USA, August 13-15, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2523, 349-365 (2002).
Summary: Since its proposal by V. Miller [Adv. cryptology – CRYPTO’85, Lect. Notes Comput. Sci. 218, 417-426 (1986; Zbl 0589.94005)] and N. Koblitz [Math. Comput. 48, 203-209 (1987; Zbl 0622.94015)] in the mid 1980s, elliptic curve cryptography (ECC) has evolved into a mature public-key cryptosystem. Offering the smallest key size and the highest strength per bit, its computational efficiency can benefit both client devices and server machines. We have designed a programmable hardware accelerator to speed up point multiplication for elliptic curves over binary polynomial fields GF\((2^m)\). The accelerator is based on a scalable architecture capable of handling curves of arbitrary field degrees 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\(^{163}\)). 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.
For the entire collection see [Zbl 1007.00053].

MSC:

94A60 Cryptography
14G50 Applications to coding theory and cryptography of arithmetic geometry
11Y16 Number-theoretic algorithms; complexity
68M07 Mathematical problems of computer architecture

Software:

OpenSSL
PDFBibTeX XMLCite
Full Text: Link