A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\)

DOI10.1016/S0304-3975(99)00061-4zbMath1007.11080OpenAlexW2047064623MaRDI QIDQ1575856

Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00061-4

zbMATH Keywords

group of rational pointsJacobianssubexponential algorithmdiscrete logarithmslarge genus hyperelliptic curves

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (6)

Fast cryptography in genus 2 ⋮ Attacking (EC)DSA Given Only an Implicit Hint ⋮ Lifting and Elliptic Curve Discrete Logarithms ⋮ The Complexity of Public-Key Cryptography ⋮ Abeliants and their application to an elementary construction of Jacobians. ⋮ Isomorphism classes of Picard curves over finite fields

This page was built for publication: A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\)