Constructing hyperelliptic curves of genus 2 suitable for cryptography
Author:
Open Access
- 3 May 2002
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 72 (241) , 435-458
Abstract
In this article we show how to generalize the CM-method for elliptic curves to genus two. We describe the algorithm in detail and discuss the results of our implementation.Keywords
This publication has 19 references indexed in Scilit:
- Examples of genus two CM curves defined over the rationalsMathematics of Computation, 1999
- Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves1998
- 2-dimensional simple factors ofJ 0(N)manuscripta mathematica, 1995
- Determination of all non-normal quartic CM-fields and of all non-abelian normal octic CM-fields with class number oneActa Arithmetica, 1994
- Elliptic Curves and Primality ProvingMathematics of Computation, 1993
- Computing Frobenius maps and factoring polynomialscomputational complexity, 1992
- Construction de courbes de genre 2 à partir de leurs modules1991
- Hyperelliptic cryptosystemsJournal of Cryptology, 1989
- Primality of the number of points on an elliptic curve over a finite fieldPacific Journal of Mathematics, 1988
- Arithmetic Variety of Moduli for Genus TwoAnnals of Mathematics, 1960