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

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

2007-03-07

arxiv.org/abs/cs/0703032v1

Dans Eurocrypt 2007 (2007)

Computer Science

Cryptography and Security

Scientific paper

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+\epsilon, o(1))$ for any positive $\epsilon$. These runtime bounds rely on heuristics similar to the ones used in the number field sieve or the function field sieve algorithms.

Affiliated with

Also associated with

No associations

Rating

An $L (1/3 + ε)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An $L (1/3 + ε)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An $L (1/3 + ε)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-254603