Article

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

04/2007;
Source: arXiv

ABSTRACT The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose degrees in $X$ and $Y$ are low with respect to the curve genus, and suitably unbalanced. The finite base fields are arbitrary, but their sizes should not grow too fast compared to the genus. For this family, the group structure can be computed in subexponential time of $L_{q^g}(1/3, O(1))$, and a discrete logarithm computation takes subexponential time of $L_{q^g}(1/3+\varepsilon, o(1))$ for any positive~$\varepsilon$. These runtime bounds rely on heuristics similar to the ones used in the number field sieve or the function field sieve algorithms.

0 0
·
0 Bookmarks
·
68 Views
• Conference Proceeding: An Index Calculus Algorithm for Plane Curves of Small Degree.
[hide abstract]
ABSTRACT: We present an index calculus algorithm which is particularly well suited to solve the discrete logarithm problem (DLP) in degree 0 class groups of curves over finite fields which are represented by plane models of small degree. A heuristic analysis of our algorithm indicates that asymptotically for varying q, “almost all” instances of the DLP in degree 0 class groups of curves represented by plane models of a fixed degree d ≥4 over \mathbbFq\mathbb{F}_{q} can be solved in an expected time of [(O)\tilde](q2-2/(d-2))\tilde{O}(q^{2-2/(d-2)}). Additionally we provide a method to represent “sufficiently general” (non-hyperelliptic) curves of genus g ≥3 by plane models of degree g+1. We conclude that on heuristic grounds, “almost all” instances of the DLP in degree 0 class groups of (non-hyperelliptic) curves of a fixed genus g ≥3 (represented initially by plane models of bounded degree) can be solved in an expected time of [(O)\tilde](q2 -2/(g-1))\tilde{O}(q^{2 -2/(g-1)}).
Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings; 01/2006
• Source
Article: Computing Discrete Logarithms in High-Genus Hyperelliptic Jacobians in Provably Subexponential Time
[hide abstract]
ABSTRACT: We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. More precisely, the running time for instances with genus g and underlying finite field F q satisfying g  log q for a positive constant  is given by O  e i 5 2 p 3 iq 1+ 3  + q 3 ` j +o(1) jp (g log q) log(g log q) ' . The algorithm works over any finite field, and its running time does not rely on any unproven assumptions. 1 Motivation and Main Result Jacobians of hyperelliptic curves over finite fields were suggested for use in public key cryptosystems by Koblitz in 1989 ([13]). As abelian groups, these structures are adequate for Diffie--Hellman type systems, whose security relies on the intractability of the discrete logarithm problem in the underlying group. In principle, hyperelliptic cryptosystems offer the same security as elliptic cryptosystems of the same key length. However, in 1995 Adleman, DeMarrai...
Mathematics of Computation 03/1999; · 1.37 Impact Factor
• Source
Article: A General Framework for Subexponential Discrete Logarithm Algorithms
[hide abstract]
ABSTRACT: We describe a generic algorithm for computing discrete logarithms in groups of known order in which a smoothness concept is available. The running time of the algorithm can be proved without using any heuristics and leads to a subexponential complexity in particular for finite fields and class groups of number and function fields which were proposed for use in cryptography. In class groups, our algorithm is substantially faster than previously suggested ones. The subexponential complexity is obtained for cyclic groups in which a certain smoothness assumption is satisfied. We also show how to modify the algorithm for cyclic subgroups of arbitrary groups when the smoothness assumption can only be verified for the full group. Keywords: discrete logarithm, index calculus, class groups, subexponentiality. R'esum'e Nous d'ecrivons un algorithme g'en'erique pour calculer des logarithmes discrets dans les groupes d'ordre connu pour lesquels une certaine notion de friabilit'e est disponible. L...
07/2000;