快速与 Frobenius:有限域上的有理同源求值
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields
AI总结:
本文研究有限域上椭圆曲线同源的高效求值问题,通过特殊加法链改进 $k=1$ 时的 V{é}lu 风格算法,并结合 Galois 作用显著提升 $k>1$ 时的性能,为 CSIDH 等后量子密码系统提供更优实现。
摘要:
考虑在有限域 $\mathbb{F}_q$ 上高效求值椭圆曲线同源 $ϕ: E \to E/H$ 的问题,其中核 $H = \langle G\rangle$ 是奇数(素数)阶循环群:给定 $E$、$G$ 和 $E$ 上的一个或多个点 $P$,我们希望计算 $ϕ(P)$。该问题是 CSIDH 等基于群作用和同源的后量子密码系统高效实现的核心。当核生成元 $G$ 定义在 $\mathbb{F}_q$ 上时,基于 V{é}lu 公式的算法为该问题提供了高效解决方案。然而,对于一般同源,$G$ 仅定义在某个扩展域 $\mathbb{F}_{q^k}$ 上,尽管 $\langle G\rangle$ 整体(以及 $ϕ$)定义在基域 $\mathbb{F}_q$ 上;随着 $k$ 增大,V{é}lu 风格算法的性能会迅速下降。本文重新探讨同源求值问题,特别关注 $1 \le k \le 12$ 的情况。我们利用特殊加法链改进了 $k = 1$ 时多种情况的 V{é}lu 风格同源求值,并结合 Galois 作用在 $k > 1$ 时实现了更大改进。
英文摘要:
Consider the problem of efficiently evaluating isogenies $ϕ: E \to E/H$ of elliptic curves over a finite field $\mathbb{F}_q$, where the kernel $H = \langle G\rangle$ is a cyclic group of odd (prime) order: given $E$, $G$, and a point (or several points) $P$ on $E$, we want to compute $ϕ(P)$. This problem is at the heart of efficient implementations of group-action- and isogeny-based post-quantum cryptosystems such as CSIDH. Algorithms based on V{é}lu's formulae give an efficient solution to this problem when the kernel generator $G$ is defined over $\mathbb{F}_q$. However, for general isogenies, $G$ is only defined over some extension $\mathbb{F}_{q^k}$, even though $\langle G\rangle$ as a whole (and thus $ϕ$) is defined over the base field $\mathbb{F}_q$; and the performance of V{é}lu-style algorithms degrades rapidly as $k$ grows. In this article we revisit the isogeny-evaluation problem with a special focus on the case where $1 \le k \le 12$. We improve V{é}lu-style isogeny evaluation for many cases where $k = 1$ using special addition chains, and combine this with the action of Galois to give greater improvements when $k > 1$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。