Abstract
AbstractThe discrete logarithm problem in Jacobians of curves of high genus g over finite fields \(\mathbb {F}_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 ε. These runtime bounds rely on heuristics similar to the ones used in the number field sieve or the function field sieve algorithms.KeywordsPrime DivisorDiscrete LogarithmHyperelliptic CurveSmith Normal FormSmooth DivisorThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.