扩展GLS自同态以使用Magma加速GHS Weil下降
Extending the GLS endomorphism to speed up GHS Weil descent using Magma
摘要:
设$q = 2^n$,$E / \mathbb{F}_{q^{\ell}}$是广义Galbraith-Lin-Scott(GLS)二元曲线,其中$\ell \ge 2$和$(\ell, n) = 1$。我们证明了$E / \mathbb{F}_{q^{\ell}}$上的GLS自同态在亏格- $g$超椭圆曲线$H$的Jacobian $J_H(\mathbb{F}_q)$上诱导了一个有效的自同态,对应于对$E/\mathbb{F}_{q^\ell}$施加的GHS Weil下降攻击的图像,并且当使用标准指数演算过程来求解$J_H(\mathbb{F}_q)$上的离散对数问题(DLP)时,该自同态产生因子$n$加速。我们的分析是支持的显式计算的离散对数定义的素数阶子群的GLS椭圆曲线上的字段$\mathbb{F}_{2^{5\cdot 31}}$。我们算法的Magma实现在大约$1,035$ CPU天内找到上述离散对数。
英文摘要:
Let $q = 2^n$, and let $E / \mathbb{F}_{q^{\ell}}$ be a generalized Galbraith--Lin--Scott (GLS) binary curve, with $\ell \ge 2$ and $(\ell, n) = 1$.We show that the GLS endomorphism on $E / \mathbb{F}_{q^{\ell}}$ induces an efficient endomorphism on the Jacobian $J_H(\mathbb{F}_q)$ of the genus-$g$ hyperelliptic curve $H$ corresponding to the image of the GHS Weil-descent attack applied to $E/\mathbb{F}_{q^\ell}$, and that this endomorphism yields a factor-$n$ speedup when using standard index-calculus procedures for solving the Discrete Logarithm Problem (DLP) on $J_H(\mathbb{F}_q)$. Our analysis is backed up by the explicit computation of a discrete logarithm defined on a prime-order subgroup of a GLS elliptic curve over the field $\mathbb{F}_{2^{5\cdot 31}}$. A Magma implementation of our algorithm finds the aforementioned discrete logarithm in about $1,035$ CPU-days.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。