On the Complexity of Hyperelliptic Discrete Logarithm Problem

DOI10.1007/3-540-46416-6_29zbMath0791.68081OpenAlexW1590084875MaRDI QIDQ4037478

Hiroki Shuzuya, Kouichi Sakurai, Toshiya Itoh

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

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

Related Items (1)

Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield

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