Paper 2011/306
Group Law Computations on Jacobians of Hyperelliptic Curves
Craig Costello and Kristin Lauter
Abstract
We derive an explicit method of computing the composition step in Cantor's algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the geometric description of the group law and applies to hyperelliptic curves of arbitrary genus. While Cantor's general composition involves arithmetic in the polynomial ring $F_q[x]$, the algorithm we propose solves a linear system over the base field which can be written down directly from the Mumford coordinates of the group elements. We apply this method to give more efficient formulas for group operations in both affine and projective coordinates for cryptographic systems based on Jacobians of genus 2 hyperelliptic curves in general form.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Hyperelliptic curvesgroup lawJacobian arithmeticgenus 2.
- Contact author(s)
- craig costello @ qut edu au
- History
- 2011-09-19: revised
- 2011-06-09: received
- See all versions
- Short URL
- https://ia.cr/2011/306
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/306,
author = {Craig Costello and Kristin Lauter},
title = {Group Law Computations on Jacobians of Hyperelliptic Curves},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/306},
year = {2011},
url = {https://eprint.iacr.org/2011/306}
}
