arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1003.4759math.NT
收藏

亏格为2的复乘曲线

Genus 2 Curves with Complex Multiplication

Eyal Z. Goren, Kristin E. Lauter

摘要:

亏格2曲线在密码学中对于基于离散对数和基于配对的系统都是有用的,但是需要一种方法来计算亏格2曲线,使得雅可比矩阵具有给定数量的点。目前,所有已知的方法都涉及通过计算它们的三个Igusa类多项式来用复乘构造亏格2曲线。这些多项式具有有理系数,并且需要大量的计算和精度来计算。通过对多项式系数的分解子的更精确的理解,可以改进这些算法的计算量和复杂度分析。本文的主要目的是给出亏格为2的曲线的Igusa类多项式的CM乘子在一个本原四次CM域上的一个界。本文综述了Igusa关于亏格为2的曲线的模空间的结果以及利用它们的Igusa不变量构造亏格为2的曲线的方法。我们还给出了一个完整的表征减少类型的CM阿贝尔曲面,双二次,循环,和非伽罗瓦四次CM领域,并为任何类型的总理分解的总理,包括分歧素。主要结果的证明方法涉及到研究四次CM域嵌入到四元数上的矩阵代数中的问题和引用晶体形变理论的技巧。

英文摘要:

Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve constructing genus 2 curves with complex multiplication via computing their three Igusa class polynomials. These polynomials have rational coefficients and require extensive computation and precision to compute. Both the computation and the complexity analysis of these algorithms can be improved by a more precise understanding of the denominators of the coefficients of the polynomials. The main goal of this paper is to give a bound on the denominators of Igusa class polynomials of genus 2 curves with CM by a primitive quartic CM field. We give an overview of Igusa's results on the moduli space of genus two curves and the method to construct genus 2 curves via their Igusa invariants. We also give a complete characterization of the reduction type of a CM abelian surface, for biquadratic, cyclic, and non-Galois quartic CM fields, and for any type of prime decomposition of the prime, including ramified primes. The methods of the proof of the main result involve studying the embedding problem of the quartic CM field into certain matrix algebras over quaternions and invoking techniques from crystalline deformation theory.

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

↑