A Public-Key Cryptographic Processor for RSA and ECC

• Authors: Hans Eberle;Nils Gura;Sheueling Chang Shantz;Vipul Gupta;Leonard Rarick;Shreyas Sundaram
• Venue: ASAP '04 Proceedings of the Application-Specific Systems, Architectures and Processors, 15th IEEE International Conference
• Year: 2004

We describe a general-purpose processor architecture for accelerating public-key computations on server systems that demand high performance and flexibility to accomodate large numbers of secure connections with heterogeneous clients that are likely to be limited in the set of cryptographic algorithms supported.Flexibility is achieved in that the processor supports multiple pubic-key cryptosystems, namely RSA, DSA, DH, and ECC, arbitrary key sizes and, in the case of ECC, arbitrary curves over fields GF(p) and GF(2^m). At the core of the processor is a novel dual-field multiplier based on a modified carry-save adder (CSA) tree that supports both GF(p) and GF(2^m).In the case of a 64-bit integer multiplier, the necessary modifications increase its size by a mere 5%.To efficiently schedule the multiplier, we implemented a multiply-accumulate instruction that combines several steps of a multiple-precision multiplication in a single operation: multiplication, carry propagation, and partial product accumulation. We have developed a hardware prototype of the cryptographic processor in FPGA technology. If implemented in current 1.5 GHz processor technology, the processor executes 5,265 RSA-1024 op/s and 25,756 ECC-163 op/s - the given key sizes offer comparable security strength.Looking at future security levels, performance is 786 op/s for RSA-2048 and 9,576 op/s for ECC-233.