Paper 2014/996
Some experiments investigating a possible L(1/4) algorithm for the discrete logarithm problem in algebraic curves
Maike Massierer
Abstract
The function field sieve, a subexponential algorithm of complexity L(1/3) that computes discrete logarithms in finite fields, has recently been improved to an algorithm of complexity L(1/4) and subsequently to a quasi-polynomial time algorithm. We investigate whether the new ideas also apply to index calculus algorithms for computing discrete logarithms in Jacobians of algebraic curves. While we do not give a final answer to the question, we discuss a number of ideas, experiments, and possible conclusions.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- discrete logarithm problemindex calculusalgebraic curvesfunction field sieve
- Contact author(s)
- maike massierer @ inria fr
- History
- 2014-12-18: received
- Short URL
- https://ia.cr/2014/996
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/996,
author = {Maike Massierer},
title = {Some experiments investigating a possible L(1/4) algorithm for the discrete logarithm problem in algebraic curves},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/996},
year = {2014},
url = {https://eprint.iacr.org/2014/996}
}
