On the Complexity of Hyperelliptic Discrete Logarithm Problem

DOI10.1007/3-540-46416-6_29MaRDI QIDQ4037478zbMATH OpenOpenAlexFDO

Authors Hiroki Shuzuya, Toshiya Itoh, Kouichi Sakurai

Publication date 18 May 1993

Published in Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_29

zbMATH Keywords

hyperelliptic discrete logarithm problem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Algebraic functions and function fields in algebraic geometry (14H05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• An algorithm for solving the discrete log problem on hyperelliptic curves
• scientific article; zbMATH DE number 1107697
• On the discrete logarithm problem for plane curves
• scientific article; zbMATH DE number 503355
• scientific article; zbMATH DE number 2154287

Cited in

(3)

• Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield
• Generic Hardness of the Multiple Discrete Logarithm Problem
• scientific article; zbMATH DE number 503355 (Why is no real title available?)

This page was built for publication: On the Complexity of Hyperelliptic Discrete Logarithm Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037478)