Hyperelliptic cryptosystems |
| |
Authors: | Neal Koblitz |
| |
Affiliation: | (1) Department of Mathematics GN-50, University of Washington, 98195 Seattle, WA, U.S.A. |
| |
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 are given, and the problem of finding groups of almost prime order is discussed. |
| |
Keywords: | Cryptosystem Public key Discrete logarithm Hyperelliptic curve Jacobian |
本文献已被 SpringerLink 等数据库收录! |