An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves

DOI10.1007/978-3-540-72540-4_22zbMath1141.94352arXivcs/0703032OpenAlexW3123250145MaRDI QIDQ5429402

Pierrick Gaudry, Andreas Enge

Publication date: 29 November 2007

Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0703032

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (5)

Index calculus in the trace zero variety ⋮ An \(L(1/3)\) discrete logarithm algorithm for low degree curves ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ Subexponential time relations in the class group of large degree number fields ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem

This page was built for publication: An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves