Lejla Batina, SafeNet BV/Katholieke Universiteit Leuven, ESAT/SCD-COSIC
Bart Preneel, Katholieke Universiteit Leuven, ESAT/SCD-COSIC
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 (PKC), 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.
Index Terms:
Elliptic Curve Cryptosystems, Modular Operations, FPGA
Citation:
S?dd?ka Berna Ors, Lejla Batina, Bart Preneel, Joos Vandewalle, "Hardware Implementation of an Elliptic Curve Processor over GF(p)," asap, pp.433, 14th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'03), 2003