arXiv math/04092092004-09math.NTmath.AG

Asymptotically fast group operations on Jacobians of general curves

Kamal Khuri-Makdisi

备注：: 27 pages, considerably improved and streamlined revision of previous draft. Readers wishing to consult the previous extended draft should download version 2 of this paper
发表信息：: Math. Comp. 76 (2007), 2213-2239

英文摘要：

Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$, the algorithms use only linear algebra in vector spaces of dimension at most $O(g \log g)$, and so take $O(g^{3 + ε})$ field operations in $k$, using Gaussian elimination. Using fast algorithms for the linear algebra, one can improve this time to $O(g^{2.376})$. This represents a significant improvement over the previous record of $O(g^4)$ field operations (also after a precomputation) for general curves of genus $g$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

有限域上三维阿贝尔簇同源类中的超椭圆雅可比簇

Hyperelliptic Jacobians in Isogeny Classes of Abelian Threefolds Over Finite Fields

本文针对有限域上三维阿贝尔簇同源类是否包含亏格3超椭圆曲线雅可比簇的问题，基于韦伊多项式分析提出新的阻碍判据，并猜想其中两个阻碍可在q趋于无穷时渐近分类所有同源类。

2025-08-23math.AGmath.NT

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

Let 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, typicall…

2007-08-22cs.SCmath.AGmath.NT

Group Operation on Nodal Curves

In this work, we present an efficient method for computing in the Generalized Jacobian of special singular curves. The efficiency of the operation is due to representation of an element in the Jacobian group by a single polynomial.

2019-04-08math.NT

Computing in Jacobians of projective curves over finite fields

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations can be done efficiently in this setting: decomposing divisors into prime divisors; computing pull-backs and push-forwards of divisors under finite morphisms, and hence Picard and Albanese maps on Jacobians; generating uniformly random divisors and points on Jacobians; computing Frobenius maps and Kummer maps; and finding a basis for the $l$-torsion of the Pic…

2010-03-12math.AGmath.NT

Curves of every genus with many points, II: Asymptotically good families

We resolve a 1983 question of Serre by constructing curves with many points of every genus over every finite field. More precisely, we show that for every prime power q there is a positive constant c_q with the following property: for every non-negative integer g, there is a genus-g curve over F_q with at least c_q * g rational points over F_q. Moreover, we show that there exists a positive constant d such that for every q we can choose c_q = d * (log q). We show also that there is a constant c > 0 such that for every q and every n > 0, and for every sufficiently large g, there is a genus-g cu…

2002-08-08math.AGmath.NT

关于特征为2的有限域上超椭圆曲线的Weil多项式

On Weil Polynomials of Hyperelliptic Curves over Finite Fields of Characteristic 2

本文通过模2剩余类约束给出特征2有限域上超椭圆雅可比矩阵存在性的新阻碍条件，证明Weil系数奇偶性渐近等分布，并据此排除大量3维和4维同源类，同时提出运行时间显著改进的任意亏格超椭圆曲线枚举算法。

2025-08-23math.AGmath.NT

更多相关论文收起更多论文

秩≥1和秩≥2的亏格2雅可比的对数密度及其在超椭圆曲线密码学中的应用

Logarithmic Density of Rank $\geq 1$ and Rank $\geq 2$ Genus-2 Jacobians and Applications to Hyperelliptic Curve Cryptography

Institut de mathématiques de Bordeaux (Bordeaux INP, CNRS, Univ. Bordeaux)（波尔多数学研究所）；Inria Bordeaux（法国国家信息与自动化研究所波尔多中心）；Institute of Mathematics of the Romanian Academy（罗马尼亚科学院数学研究所）；CertSIGN, Bucharest（布加勒斯特CertSIGN公司）；Babeş-Bolyai University, Cluj-Napoca（博巴伊-玻艾尤大学）

研究亏格2曲线雅可比秩≥1或2的定量存在性，通过几何方法证明几乎所有具有两个无穷远有理点的积分模型雅可比秩≥1，并给出秩≥2的无条件对数密度下界，应用于超椭圆曲线密码学。

2026-06-05cs.CRmath.NT

Jacobiens, jacobiennes et stabilité numérique

This paper is concerned with the complexity and stability of arithmetic operations in the jacobian variety of curves over the field of complex numbers, as the genus grows to infinity. We focus on modular curves. Efficient and stable computation in the jacobian of modular curves is useful for computing coefficients of modular forms in deterministic polynomial time. This work is part of my contribution to Edixhoven's program for solving this problem.

2006-06-09math.NT

An Application of Nodal Curves

In this work, we present an efficient method for computing in the generalized Jacobian of special singular curves, nodal curves. The efficiency of the operation is due to the representation of an element in the Jacobian group by a single polynomial. In addition, we propose a probabilistic public key algorithm as an application of nodal curves.

2022-06-13cs.CRcs.ITmath.IT

Linear algebra algorithms for divisors on an algebraic curve

We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and matrices of size $O(g^2)\times O(g)$. When the base field $k$ is finite, or if $C$ has a rational point over $k$, these give algorithms for working on the Jacobian of $C$ that require $O(g^4)$ field operations, arising from the Gaussian elimination. Our point of view is strongly geometric, and our representation of points on the Jacobian is fairly simple to work…

2002-06-29math.AGmath.NT

Efficient Point-Counting Algorithms for Superelliptic Curves

In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with the Hasse-Witt matrix for superelliptic curves, whose entries we express in terms of multinomial coefficients. We present a fast algorithm for counting points on specific trinomial superelliptic curves and a slower, more general method for all superelliptic curves. For the first case, we reduce the problem of simplifying the entries of the Hasse-Witt matrix…

2017-09-07math.NT

Computing Jacobi's $θ$ in quasi-linear time

Jacobi's $θ$ function has numerous applications in mathematics and computer science; a naive algorithm allows the computation of $θ(z,τ)$, for $z, τ$ verifying certain conditions, with precision $P$ in $O(\mathcal{M}(P) \sqrt{P})$ bit operations, where $\mathcal{M}(P)$ denotes the number of operations needed to multiply two complex $P$-bit numbers. We generalize an algorithm which computes specific values of the $θ$ function (the \textit{theta-constants}) in asymptotically faster time; this gives us an algorithm to compute $θ(z, τ)$ with precision $P$ in $O(\mathcal{M}(P) \log P)$ bit operatio…

2015-11-13math.NT