Efficient algorithms for the construction of hyperelliptic cryptosystems

Tatsuaki Okamoto, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

The jacobian of hyperelliptic curves, including elliptic curves as a special case, offers a good primitive for cryptosystems, since cryptosystems (discrete logarithms) based on the jacobians seem to be more intractable than those based on conventional multiplicative groups. In this paper, we show that the problem to determine the group structure of the jacobian can be characterized to be in NP ∩ co-NP, when the jacobian is a non-degenerate type (“non-half-degenerate”). We also show that the hyperelliptic discrete logarithm can be characterized to be in NP ∩ co-NP, when the group structure is non-half-degenerate. Moreover, we imply the reducibility of the hyperelliptic discrete logarithm to a multiplicative discrete logarithm. The extended Weil pairing over the jacobian is the key tool for these algorithms.

Original languageEnglish
Title of host publicationAdvances in Cryptology — CRYPTO 1991, Proceedings
EditorsJoan Feigenbaum
PublisherSpringer Verlag
Pages267-278
Number of pages12
ISBN (Print)9783540551881
DOIs
Publication statusPublished - 1992
Externally publishedYes
Event11th Confrence on Advances in Cryptology, CRYPTO 1991 - Santa Barbara, United States
Duration: Aug 11 1991Aug 15 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume576 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th Confrence on Advances in Cryptology, CRYPTO 1991
CountryUnited States
CitySanta Barbara
Period8/11/918/15/91

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient algorithms for the construction of hyperelliptic cryptosystems'. Together they form a unique fingerprint.

Cite this