Title: Hardware implementation of an elliptic curve processor over GF(p) with Montgomery modular multiplier

Authors: Berna Ors, Lejla Batina, Bart Preneel, Joos Vandewalle

Addresses: Istanbul Technical University, Faculty of Electrical and Electronics Engineering, Maslak, Istanbul, Turkey. ' Katholieke Universiteit Leuven, ESAT/SCD-COSIC, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium. ' Katholieke Universiteit Leuven, ESAT/SCD-COSIC, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium. ' Katholieke Universiteit Leuven, ESAT/SCD-COSIC, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium

Abstract: This paper describes a hardware implementation of an arithmetic processor which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptography, i.e., Elliptic Curve (EC) and RSA Cryptosystems. Montgomery modular multiplication in a systolic array architecture is used for modular multiplication. The processor consists of special operational blocks for Montgomery modular multiplication, modular addition/subtraction, EC Point doubling/addition, modular multiplicative inversion, EC point multiplier, projective to affine coordinates conversion and Montgomery to normal representation conversion.

Keywords: elliptic curve cryptosystems; MMM; Montgomery modular multiplication; modular operations; FPGA; elliptic curve processors; public key cryptography; security; systolic array architecture.

DOI: 10.1504/IJES.2008.022394

International Journal of Embedded Systems, 2008 Vol.3 No.4, pp.229 - 240

Available online: 03 Jan 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article