Efficient construction of secure hyperelliptic discrete logarithm problems

DOI10.1007/BFB0028485MaRDI QIDQ4373642zbMATH OpenFDO

Authors Jinhui Chao, Nori Matsuda, Shigeo Tsujii

Publication date 21 January 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028485

zbMATH Keywords

cryptographic functionscryptosystemsdefine discrete logarithmhyperelliptic curves

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Arithmetic ground fields for curves (14H25) Computational aspects of algebraic curves (14Q05) Cryptography (94A60)

Recommendations

• An algorithm for solving the discrete log problem on hyperelliptic curves
• Secure hyperelliptic cryptosystems and their performance
• scientific article; zbMATH DE number 2154287
• Hyperelliptic cryptosystems
• scientific article; zbMATH DE number 1583784

Cited in

(5)

• Formulae for arithmetic on genus 2 hyperelliptic curves
• Pell hyperbolas in DLP-based cryptosystems
• On the Complexity of Hyperelliptic Discrete Logarithm Problem
• Asymmetric cryptography and hyperelliptic sequences
• Fault attacks on hyperelliptic curve discrete logarithm problem over binary field

This page was built for publication: Efficient construction of secure hyperelliptic discrete logarithm problems

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