Very Fast Elliptic Curve Cryptography Public-Key Generator on Koblitz Curves

This paper presents Xilinx vertex-5 FPGA-based very fast elliptic curve cryptography public key generator on Koblitz curves targeting for applications requiring high speed. The generator supports both fast computation of point multiplication using window method and multiple point multiplications with joint sparse form representations. In order to achieve better performance, optimized operation-specific processing units are utilized. Throughput is enhanced using pipelining techniques. The generator computes point multiplication on average in 16.95 ?s and achieves a maximum of 160,920 operations per second. A 2-term multiple point multiplication requires 35.12 ?s with a maximum of 61,719 operations per second.

Provided by: Universal Association of Computer and Electronics Engineers Topic: Security Date Added: May 2012 Format: PDF

Download Now

Find By Topic