论文信息 - Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae

Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae

We extend the explicit formulae for arithmetic on genus two curves of [13, 21] to fields of even characteristic and to arbitrary equation of the curve. These formulae can be evaluated faster than the more general Cantor algorithm and allow to obtain faster arithmetic on a hyperelliptic genus 2 curve than on elliptic curves. We give timings for implementations using various libraries for the field arithmetic.

Tanja Lange | T. Lange

[1] D. Mumford. Tata Lectures on Theta I , 1982 .

[2] Neal Koblitz,et al. Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.

[3] Dino J. Lorenzini. An Invitation to Arithmetic Geometry , 1996 .

[4] Tanja Lange. Efficient Arithmetic on Hyperelliptic Curves , 2002, IACR Cryptol. ePrint Arch..

[5] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .

[6] D. Cantor. Computing in the Jacobian of a hyperelliptic curve , 1987 .

[7] Anne-Monika Spallek,et al. Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen , 1994 .

[8] Kazuto Matsuo,et al. Fast Genus Three Hyperelliptic Curve Cryptosystems , 2002 .

[9] R. Zuccherato,et al. An elementary introduction to hyperelliptic curves , 1996 .

[10] Tanja Lange. Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves , 2002, IACR Cryptol. ePrint Arch..

[11] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.