An FPGA implementation of an elliptic curve processor GF(2m)

  • Authors:
  • Nele Mentens;Siddika Berna Ors;Bart Preneel

  • Affiliations:
  • K.U.Leuven, ESAT/COSIC, Leuven-Heverlee, Belgium;K.U.Leuven, ESAT/COSIC, Leuven-Heverlee, Belgium;K.U.Leuven, ESAT/COSIC, Leuven-Heverlee, Belgium

  • Venue:
  • Proceedings of the 14th ACM Great Lakes symposium on VLSI
  • Year:
  • 2004

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock frequency becomes independent of the bit length m.