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

在拟最优时间内计算可分同构

Computing separable isogenies in quasi-optimal time

David Lubicz, Damien Robert

摘要:

令$A$是维度$g$的阿贝尔簇以及在域$k$上定义的主极化$ϕ: A \rightarrow \hat{A}$。设$\ell$是与$k$的特征互素的奇整数,$K$是$A[\ell]$的一个子群,它对于与$ϕ$相关的黎曼形式是极大迷向的.我们假设$K$是定义在$k$和让$B=A/K$是商阿贝尔簇连同一个极化兼容的$ϕ$。在$k$上定义了作为极化阿贝尔簇的$B$和同构$f:A\rightarrow B$.在本文中,我们描述了一种算法,作为输入的θ零点的$A$和多项式系统定义$K$和输出的θ零点的$B$以及公式的isketPDMATHABMX。我们在$k$中得到了$\tilde{O}(\ell^{\frac{rg}{2}})$操作的复杂度,其中$r=2$(分别为.如果$r=4$是两个平方之和(分别为如果$\ell$是四个平方的和),这构成了对[7]中描述的算法的改进。我们注意到,如果$\ell$是两个平方和的算法是准最优的,因为它的复杂性是准线性的$f$的程度。

英文摘要:

Let $A$ be an abelian variety of dimension $g$ together with a principal polarization $ϕ: A \rightarrow \hat{A}$ defined over a field $k$. Let $\ell$ be an odd integer prime to the characteristic of $k$ and let $K$ be a subgroup of $A[\ell]$ which is maximal isotropic for the Riemann form associated to $ϕ$. We suppose that $K$ is defined over $k$ and let $B=A/K$ be the quotient abelian variety together with a polarization compatible with $ϕ$. Then $B$, as a polarized abelian variety, and the isogeny $f:A\rightarrow B$ are also defined over $k$. In this paper, we describe an algorithm that takes as input a theta null point of $A$ and a polynomial system defining $K$ and outputs a theta null point of $B$ as well as formulas for the isogeny $f$. We obtain a complexity of $\tilde{O}(\ell^{\frac{rg}{2}})$ operations in $k$ where $r=2$ (resp. $r=4$) if $\ell$ is a sum of two squares (resp. if $\ell$ is a sum of four squares) which constitutes an improvement over the algorithm described in [7]. We note that the algorithm is quasi-optimal if $\ell$ is a sum of two squares since its complexity is quasi-linear in the degree of $f$.

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

↑