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

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.

• Type: Conference
• Year: 2001
• Where: CHES
• Authors: Gerardo Orlando, Christof Paar
• Keywords: CHES 2001, Cryptology, Curve Processor Architecture, Memory-rich Hardware Platforms, Programmable Gate Arrays