Fast Jacobian group operations for C_{3,4} curves over a large finite field

Simple item page
dc.creatorSalem, Fatima K. Abu
dc.creatorKhuri-Makdisi, Kamal
dc.date2006-10-03
dc.date2007-08-22
dc.date.accessioned2026-07-07T08:25:05Z
dc.date.available2026-07-07T08:25:05Z
dc.descriptionLet C be an arbitrary smooth algebraic curve of genus g over a large finite field K. We revisit fast addition algorithms in the Jacobian of C due to Khuri-Makdisi (math.NT/0409209, to appear in Math. Comp.). The algorithms, which reduce to linear algebra in vector spaces of dimension O(g) once |K| >> g, and which asymptotically require O(g^{2.376}) field operations using fast linear algebra, are shown to perform efficiently even for certain low genus curves. Specifically, we provide explicit formulae for performing the group law on Jacobians of C_{3,4} curves of genus 3. We show that, typically, the addition of two distinct elements in the Jacobian of a C_{3,4} curve requires 117 multiplications and 2 inversions in K, and an element can be doubled using 129 multiplications and 2 inversions in K. This represents an improvement of approximately 20% over previous methods.
dc.description25 pages, identical to version 2 except for a remark about the published version of the article, which includes Magma code for the algorithms
dc.identifierhttps://arxiv.org/abs/math/0610121
dc.identifierhttp://arxiv.org/abs/math/0610121
dc.identifierLMS J. Comput. Math. 10 (2007) 307-328, may be downloaded from http://www.lms.ac.uk/jcm/10/lms2006-049/
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136552
dc.subjectNumber Theory
dc.subjectSymbolic Computation
dc.subjectAlgebraic Geometry
dc.subject14Q05, 14H40, 14H45, 11Y16, 68W30
dc.titleFast Jacobian group operations for C_{3,4} curves over a large finite field
dc.typetext

Files

Collections

arXiv