A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware

  • Authors:
  • Gerardo Orlando;Christof Paar

  • Affiliations:
  • -;-

  • Venue:
  • CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF(p). This is a scalable architecture in terms of area and speed specially suited for memory-rich hardware platforms such a field programmable gate arrays (FPGAs). This processor uses a new type of high-radix Montgomery multiplier that relies on the precomputation of frequently used values and on the use of multiple processing engines.