Hardware implementation of an elliptic curve processor over GF(p) with Montgomery modular multiplier. (6th January 2009)

• Record Type: Journal Article
• Authors: Ors, Berna; Batina, Lejla; Preneel, Bart; Vandewalle, Joos
• Is Part Of: International journal of embedded systems. Volume 3:Number 4(2008)
• Page Start: 229
• Page End: 240
• Publication Date: 2009-01-06
• Subjects: elliptic curve cryptosystems -- MMM -- Montgomery modular multiplication -- modular operations -- FPGA -- elliptic curve processors -- public key cryptography -- security -- systolic array architecture; Embedded computer systems -- Periodicals; 004.16
• Languages: English
• ISSNs: 1741-1068

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.