An efficient many-core architecture for Elliptic Curve Cryptography security assessment
Indaco, Marco; Lauri, Fabio; Miele, Andrea; Trotta, Pascal
2015

Files

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. © 2015 Imperial College.

Details

Title An efficient many-core architecture for Elliptic Curve Cryptography security assessment
Author(s) Indaco, Marco ; Lauri, Fabio ; Miele, Andrea ; Trotta, Pascal
Published in 2015 25th International Conference on Field Programmable Logic and Applications (FPL)
Pages 1-6
Conference 2015 25th International Conference on Field Programmable Logic and Applications (FPL), London, 2-4 September 2015
Date 2015
Publisher IEEE
DOI https://doi.org/10.1109/FPL.2015.7293950
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Conference Papers
Work produced at EPFL
Published
Record creation date 2015-12-09

PDF