Two Topics in Hyperelliptic Cryptography

Authors:
Florian Hess;Gadiel Seroussi;Nigel P. Smart
Affiliations:
-;-;-
Venue:
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Year:
2001

Citing 8
Cited 4

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Hyperelliptic cryptosystems

Journal of Cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Constructing hyperelliptic curves of genus 2 suitable for cryptography

Mathematics of Computation
Satoh's algorithm in characteristic 2

Mathematics of Computation
Counting Points on Hyperelliptic Curves over Finite Fields

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
On the performance of hyperelliptic cryptosystems

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
An algorithm for solving the discrete log problem on hyperelliptic curves

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

ID-Based Blind Signature and Ring Signature from Pairings

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Fast bilinear maps from the tate-lichtenbaum pairing on hyperelliptic curves

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Koblitz curve cryptosystems

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 generalise concepts used in the more familiar elliptic curve case to the hyperelliptic context.