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

Marco Indaco; Fabio Lauri; Andrea Miele; Pascal Trotta

Paper 2015/638

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

Marco Indaco, Fabio Lauri, 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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Minor revision. FPL2015
Keywords: ECDLP Pollard rho FPGA elliptic curves
Contact author(s): andrea miele @ epfl ch
History: 2015-06-30: received
Short URL: https://ia.cr/2015/638
License: CC BY

BibTeX

@misc{cryptoeprint:2015/638,
      author = {Marco Indaco and Fabio Lauri and Andrea Miele and Pascal Trotta},
      title = {An Efficient Many-Core Architecture for Elliptic Curve Cryptography Security Assessment},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/638},
      year = {2015},
      url = {https://eprint.iacr.org/2015/638}
}