We explore algorithmic aspects of a simply transitive commutative group action coming from the class field theory of imaginary hyperelliptic function fields. Namely, the Jacobian of an imaginary hyperelliptic curve defined over $\mathbb F_q$ acts on a subset of isomorphism classes of Drinfeld modules. We describe an algorithm to compute the group action efficiently. This is a function field analog of the Couveignes-Rostovtsev-Stolbunov group action. We report on an explicit computation done with our proof-of-concept C++/NTL implementation; it took a fraction of a second on a standard computer. We prove that the problem of inverting the group action reduces to the problem of finding isogenies of fixed $\tau$-degree between Drinfeld $\mathbb F_q[X]$-modules, which is solvable in polynomial time thanks to an algorithm by Wesolowski. We give asymptotic complexity bounds for all algorithms presented in this paper.

翻译：我们探讨了来自虚超椭圆函数域类域论的一个简单传递交换群作用的算法方面。具体地，定义在 $\mathbb F_q$ 上的虚超椭圆曲线的雅可比簇作用于Drinfeld模的同构类子集。我们描述了一种高效计算该群作用的算法。这是Couveignes-Rostovtsev-Stolbunov群作用的函数域类比。我们报告了使用概念验证的C++/NTL实现进行的显式计算，该计算在标准计算机上耗时不到一秒。我们证明了求逆群作用的问题可归约到寻找固定$\tau$次数的Drinfeld $\mathbb F_q[X]$-模之间的同源问题，该问题可通过Wesolowski的算法在多项式时间内解决。我们给出了本文所有算法的渐近复杂度界。