On the performance of hyperelliptic cryptosystems

Authors:
Nigel P. Smart
Affiliations:
Hewlett-Packard Laboratories, Bristol, UK
Venue:
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Year:
1999

Citing 13
Cited 8

Hyperelliptic cryptosystems

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

Mathematics of Computation
A course in computational algebraic number theory

A course in computational algebraic number theory
Algebraic aspects of cryptography

Algebraic aspects of cryptography
Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p

Mathematics of Computation
Real and imaginary quadratic representations of hyperelliptic function fields

Mathematics of Computation
Efficient construction of secure hyperelliptic discrete logarithm problems

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Secure Hyperelliptic Cryptosystems and Their Performances

PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
An Algorithm of Subexponential Type Computing the Class Group of Quadratic Orders over Principal Ideal Domains

ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
Counting Rational Points on Curves and Abelian Varieties over Finite Fields

ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
Comparing Real and Imaginary Arithmetics for Divisor Class Groups of Hyperelliptic Curves

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory

Fast Scalar Multiplication on the Jacobian of a Family of Hyperelliptic Curves

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Supersingular Curves in Cryptography

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Two Topics in Hyperelliptic Cryptography

SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Elliptic and hyperelliptic curves on embedded μP

ACM Transactions on Embedded Computing Systems (TECS)
Cantor versus Harley: Optimization and Analysis of Explicit Formulae for Hyperelliptic Curve Cryptosystems

IEEE Transactions on Computers
Eta pairing computation on general divisors over hyperelliptic curves y2=xp-x+d

Journal of Symbolic Computation
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
Eta pairing computation on general divisors over hyperelliptic curves y2 = x7 - x ± 1

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to generate suitable curves for use in cryptography. This paper presents a practical comparison between the performance of elliptic curve based digital signature schemes and schemes based on hyperelliptic curves. We conclude that, at present, hyperelliptic curves offer no performance advantage over elliptic curves.