- Cite this article as:
- Koblitz, N. J. Cryptology (1989) 1: 139. doi:10.1007/BF02252872
- 305 Downloads
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 are given, and the problem of finding groups of almost prime order is discussed.