Cryptology ePrint Archive: Report 2015/638

An Efficient Many-Core Architecture for Elliptic Curve Cryptography Security Assessment

Marco Indaco and Fabio Lauri and Andrea Miele and Pascal Trotta

Abstract: Elliptic Curve Cryptography (ECC) is a popular tool to construct public-key crypto-systems. The security of ECC is based on the hardness of the elliptic curve discrete logarithm problem (ECDLP). Implementing and analyzing the performance of the best known methods to solve the ECDLP is useful to assess the security of ECC and choose security parameters in practice. We present a novel many-core hardware architecture implementing the parallel version of Pollard's rho algorithm to solve the ECDLP. This architecture results in a speed-up of almost 300% compared to the state of the art and we use it to estimate the monetary cost of solving the Certicom ECCp-131 challenge using FPGAs.

Category / Keywords: implementation / ECDLP, Pollard rho, FPGA, elliptic curves,

Original Publication (with minor differences): FPL2015

Date: received 28 Jun 2015

Contact author: andrea miele at epfl ch

Available format(s): PDF | BibTeX Citation

Version: 20150630:191135 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]