High Speed Elliptic Curve Cryptography Processor for GF(p)
Christian Pühringer, Johannes Wolkerstorfer · 2005
This paper presents an elliptic curve cryptography processor for prime fields implemented on a FPGA-PCI board. It serves as a coprocessor to acclerate cryptographic operations, like signature generation and verification. It is intented to be used on systems with a high load of such operations, like webservers for e-government applications. Performance estimates based on first synthesis results suggest that more than 10000 point multiplications over a 192 bit prime field per second can be performed on a high end FPGA, which can easily compete with the fastest reported ASIC implementations. Targeted on low-end to mid-range FPGAs it is still the fastest FPGA implementation reported for elliptic curve cryptography over prime fields. 1