Hyperelliptic cryptosystems

Abstract

In this paper we discuss a source of finite abelian groups suitable for cryptosystems based on the presumed intractability of the discrete logarithm problem for these groups. They are the jacobians of hyperelliptic curves defined over finite fields. Special attention is given to curves defined over the field of two elements. Explicit formulas and examples… (More)
DOI: 10.1007/BF02252872

2 Figures and Tables

Topics

Statistics

02040'94'97'00'03'06'09'12'15'18
Citations per Year

403 Citations

Semantic Scholar estimates that this publication has 403 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics