Abstract
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m). This is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curves and finite fields. The main features of this architecture are the use of an optimized bit- parallel squarer, a digit-serial multiplier, and two programmable pro- cessors. Through reconfiguration, the squarer and the multiplier archi- tectures can be optimized for any field order or field polynomial. The multiplier performance can also be scaled according to system’s needs. Our results show that implementations of this architecture executing the projective coordinates version of the Montgomery scalar multiplication algorithmcan compute elliptic curve scalar multiplications with arbitrary points in 0.21 msec in the field GF(2167). A result that is at least 19 times faster than documented hardware implementations and at least 37 times faster than documented software implementations.
This research was supported in part by NFS CAREER award CCR-9733246.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G.B. Agnew, R.C. Mullin, and S.A. Vanstone. An implementation of elliptic curve cryptosystems over F2155. IEEE Journal on Selected Areas in Communications, 11(5):804–813, June 1993.
ANSI X9.62-1999. Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), January 1998. Approved January 7, 1999.
ANSI X9.63-1999. Public Key Cryptography For The Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography, January 1999. Working Draft.
T. Beth and D. Gollmann. Algorithm engineering for public key algorithms. IEEE Journal on Selected Areas in Communications, 7(4):458–466, 1989.
E.F. Brickell, D.M. Gordon, K.S. McCurley, and D.B. Wilson. Fast exponentiation with precomputation. In Lecture Notes in Computer Science 658: Advances in Cryptology-EUROCRYPT’ 92, pages 200–207. Springer-Verlag, Berlin, 1993.
I. Blake, G. Seroussi, and N.P. Smart. Elliptic Curves in Cryptography. Cambridge University Press, Cambridge, UK, first edition, 1999.
P. Gaundry, F. Hess, and N.P. Smart. Constructive and destructive facets of Weil descent on elliptic curves. available at http://www.hpl.hp.com/techreports/2000/HPL-2000-10.html, January 2000.
L. Gao, S. Shrivastava, and G. Sobelman. Elliptic curve scalar multiplier design using FPGAs. In C. Koc and C. Paar, editors,Workshop on Cryptographic Hardware and Embedded Systems (CHES’ 99), volume LNCS 1717. Springer-Verlag, August 1999.
T. Itoh and S. Tsujii. A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Information and Computation, 78:171–177, 19
J. Lopez and R. Dahab. Fast multiplication on elliptic curves over GF(2m) without precomputation. In C. Koc and C. Paar, editors, Workshop on Cryptographic Hardware and Embedded Systems (CHES’ 99), volume LNCS 1717. Springer-Verlag, August 1999.
R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, Cambridge, UK, revised edition, 1994.
NIST. Recommended elliptic curves for federal government use. available at http://csrc.nist.gov/encryption, May 1999.
C. Paar, P. Fleischmann, and P. Soria-Rodriguez. Fast arithmetic for public-key algorithms in Galois fields with composite exponents. IEEE Transactions on Computers, 48(10):1025–1034, October 1999.
M. Rosner. Elliptic curve cryptosystems on reconfigurable hardware. Master’s thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, USA, May 1998.
S. Sutikno, R. Effendi, and A. Surya. Design and implementation of arithmetic processor F2155 for elliptic curve cryptosystems. In The 1998 IEEE Asia-Pacific Conference on Circuits and Systems, pages 647–650, November 1998.
R. Schroeppel, H. Orman, S. O’Malley, and O. Spatscheck. Fast key exchange with elliptic curve systems. In D. Coppersmith, editor, Advances in Cryptogaphy, Crypto 95, volume LNCS 963. Springer-Verlag, 1995.
L. Song and K. K. Parhi. Low-energy digit-serial/parallel finite field multipliers. Journal of VLSI Signal Processing Systems, 2(22):1–17, 1997.
S.A. Vanstone. Efficient implementation of elliptic curve cryptography, June 1999. Certicom Corporation Seminar.
H. Wu. Low complexity bit-parallel finite field arithmetic using polynomial basis. In C. Koc and C. Paar, editors, Workshop on Cryptographic Hardware and Embedded Systems (CHES’ 99), volume LNCS 1717. Springer-Verlag, August 1999.
Xilinx. The Programmable Logic Data Book. Xilinx, Inc., 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Orlando, G., Paar, C. (2000). A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m). In: Koç, Ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems — CHES 2000. CHES 2000. Lecture Notes in Computer Science, vol 1965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44499-8_3
Download citation
DOI: https://doi.org/10.1007/3-540-44499-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41455-1
Online ISBN: 978-3-540-44499-2
eBook Packages: Springer Book Archive