On Jacobian group arithmetic for typical divisors on curves

DOI10.1007/S40993-018-0101-6zbMATH Open1422.14063arXiv1310.6324OpenAlexW3103255258MaRDI QIDQ2316147FDOQ2316147

Authors: Kamal Khuri-Makdisi 

Publication date: 26 July 2019

Published in: Research in Number Theory (Search for Journal in Brave)

Abstract: In a previous joint article with F. Abu Salem, we gave efficient algorithms for Jacobian group arithmetic of "typical" divisor classes on C_{3,4} curves, improving on similar results by other authors. At that time, we could only state that a generic divisor was typical, and hence unlikely to be encountered if one implemented these algorithms over a very large finite field. This article pins down an explicit characterization of these typical divisors, for an arbitrary smooth projective curve of genus g >= 1 having at least one rational point. We give general algorithms for Jacobian group arithmetic with these typical divisors, and prove not only that the algorithms are correct if various divisors are typical, but also that the success of our algorithms provides a guarantee that the resulting output is correct and that the resulting input and/or output divisors are also typical. These results apply in particular to our earlier algorithms for C_{3,4} curves. As a byproduct, we obtain a further speedup of approximately 15% on our previous algorithms for C_{3,4} curves.

Full work available at URL: https://arxiv.org/abs/1310.6324

Recommendations

• Fast Jacobian group operations for \(c_{3,4}\) curves over a large finite field
• scientific article; zbMATH DE number 1643937
• scientific article; zbMATH DE number 1643944
• Asymptotically fast group operations on Jacobians of general curves
• Fast addition on non-hyperelliptic genus 3 curves
• Point counting on Picard curves in large characteristic
• Fast Jacobian arithmetic for hyperelliptic curves of genus 3
• \(C_{ab}\) curves: a quick short-cut
• Group arithmetic in \(C_{3,5}\) curves
• Public Key Cryptography – PKC 2004

zbMATH Keywords

groupJacobiancurvedivisor

Mathematics Subject Classification ID

Jacobians, Prym varieties (14H40) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Computational aspects of algebraic curves (14Q05)

Cites Work

• Asymptotically fast group operations on Jacobians of general curves
• Linear algebra algorithms for divisors on an algebraic curve
• Public Key Cryptography – PKC 2004
• The arithmetic of Jacobian groups of superelliptic cubics
• Fast Jacobian group operations for \(c_{3,4}\) curves over a large finite field
• Fast addition on non-hyperelliptic genus 3 curves
• Algorithmic Number Theory
• Group arithmetic in \(C_{3,5}\) curves
• Upper bounds for some Brill–Noether loci over a finite field

Cited In (8)

• Group Law Algorithms for Jacobian Varieties of Curves over Finite Fields
• On Jacobians with group action and coverings
• Title not available (Why is that?)
• Divisors of expected Jacobian type
• Asymptotically fast group operations on Jacobians of general curves
• Fast Jacobian group operations for \(c_{3,4}\) curves over a large finite field
• Divisor class group arithmetic on \(C_{3,4}\) curves
• Computing in Picard groups of projective curves over finite fields

This page was built for publication: On Jacobian group arithmetic for typical divisors on curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316147)