You are looking at a specific version 20171231:195807 of this paper. See the latest version.

Paper 2017/1262

A few more index calculus algorithms for the ECDLP

Gary McGuire and Daniela Mueller

Abstract

The introduction of summation polynomials for elliptic curves by Semaev has opened up new avenues of investigation in index calculus type algorithms for the elliptic curve discrete logarithm problem, and several recent papers have explored their use. Most papers use Grobner basis computations at some point. We question if Grobner bases are needed at all, and we propose a faster algorithm to solve the ECDLP that does not involve Grobner basis computations, and does not involve a linear algebra step either. We further propose an even faster algorithm that does not involve Grobner basis computations, or a linear algebra step, or summation polynomials. Our algorithms are aimed at prime order fields, although they are valid for any finite field. We give a complexity analysis of our algorithms and provide extensive computational data.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
discrete logarithm problemelliptic curve cryptosystem
Contact author(s)
gary mcguire @ ucd ie
History
2018-08-08: last of 2 revisions
2017-12-31: received
See all versions
Short URL
https://ia.cr/2017/1262
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.