A scalable GF(p) elliptic curve processor architecture for programmable hardware"

G. Orlando, Chris­tof Paar

Cryptographic Hardware and Embedded Systems, CHES 2001, Paris, France, May 14-16, 2001.


This work proposes a new elliptic curve processor architec- ture for the computation of point multiplication for curves de¯ned over ¯elds GF(p). This is a scalable architecture in terms of area and speed specially suited for memory-rich hardware platforms such a ¯eld pro- grammable 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.