Elliptic and Hyperelliptic Curves: a Practical Security Analysis

Joppe W. Bos, Craig Costello, and Andrea Miele

2014

Motivated by the advantages of using elliptic curves for discrete logarithm-based public-key cryptography, there is an active research area investigating the potential of using hyperelliptic curves of genus 2. For both types of curves, the best known algorithms to solve the discrete logarithm problem are generic attacks such as Pollard rho, for which it is well-known that the algorithm can be sped up when the target curve comes equipped with an efficiently computable automorphism. In this paper we incorporate all of the known optimizations (including those relating to the automorphism group) in order to perform a systematic security assessment of two elliptic curves and two hyperelliptic curves of genus 2. We use our software framework to give concrete estimates on the number of core years required to solve the discrete logarithm problem on four curves that target the 128-bit security level: on the standardized NIST CurveP-256, on a popular curve from the Barreto-Naehrig family, and on their respective analogues in genus 2.

See also: http://eprint.iacr.org/2013/644

Publication type | Inproceedings |

Published in | Conference on Practice and Theory of Public-Key Cryptography (PKC) |

Publisher | Springer |

- A heterogeneous computing environment to solve the 768-bit RSA challenge
- Low-Latency Elliptic Curve Scalar Multiplication
- Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using Sloppy Reduction

> Publications > Elliptic and Hyperelliptic Curves: a Practical Security Analysis