High-Speed Elliptic Curve Cryptography Accelerator for Koblitz Curves
Kimmo U. Jarvinen, Jorma O. Skyttä · 2008
We present an FPGA-based accelerator for elliptic curve cryptography on a Koblitz curve targeting for applications requiring very high speed. The accelerator supports fast computation of point multiplication by using window methods as well as multiple point multiplications with joint sparse form representations. Optimized operation-specific processing units are used in order to improve performance. Throughput is increased by pipelining operations. The accelerator was implemented in an Altera Stratix II FPGA and it computes point multiplication on average in 16.36 us and achieves a maximum of 161,290 operations per second. A 3-term multiple point multiplication requires 35.06 us with a maximum of 60,603 operations in second.