Novel efficient implementations of hyperelliptic curve cryptosystems using degenerate divisors
WISA'04 Proceedings of the 5th international conference on Information Security Applications
| Hi-index | 0.00 |
In this paper we address two important topics in hyperelliptic cryptography. The first is how to construct in a verifiably random manner hyperelliptic curves for use in cryptography in generas two and three. The second topic is how to perform divisor compression in the hyperelliptic case. Hence in both cases we generalize concepts used in the more familiar elliptic curve case to the hyperelliptic context.