Cryptology ePrint Archive: Report 2015/143

Harder, Better, Faster, Stronger - Elliptic Curve Discrete Logarithm Computations on FPGAs

Erich Wenger and Paul Wolfger

Abstract: Computing discrete logarithms takes time. It takes time to develop new algorithms, choose the best algorithms, implement these algorithms correctly and efficiently, keep the system running for several months, and, finally, publish the results. In this paper, we present a highly performant architecture that can be used to compute discrete logarithms of Weierstrass curves defined over binary fields and Koblitz curves using FPGAs. We used the architecture to compute for the first time a discrete logarithm of the elliptic curve \texttt{sect113r1}, a previously standardized binary curve, using 10 Kintex-7 FPGAs. To achieve this result, we investigated different iteration functions, used a negation map, dealt with the fruitless cycle problem, built an efficient FPGA design that processes 900 million iterations per second, and we tended for several months the optimized implementations running on the FPGAs.

Category / Keywords: implementation / elliptic curve cryptography, discrete logarithm problem, hardware design, FPGA, negation map

Original Publication (with minor differences): Journal of Cryptographic Engineering

Date: received 20 Feb 2015, last revised 17 Aug 2015

Contact author: wenger erich at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150817:133403 (All versions of this report)

Short URL: ia.cr/2015/143

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]