确定性地在$\mathbb{Z}_N^*$中找到大阶的元素
Deterministically finding an element of large order in $\mathbb{Z}_N^*$
AI总结:
本文改进了确定性寻找模整数$N$的高乘法阶元素的问题,提出了一种在$D>N$时运行时间更优的算法,同时提供了一个更简单的变体。
摘要:
本文提出了一种改进方法,用于确定性地找到模整数$N$的高乘法阶元素。给定正整数$D<N$,其中$D > \exp\left(\sqrt{2\log N \log \log N}\right)$,算法可返回一个阶大于$D$的元素、非平凡因子或报告$N$为质数。算法运行时间为$O(D^{1/2 + o(1)})$。Harvey和Hittmeir在2026年独立地同时得到了类似结果。此前,Oznovich和Volk的算法要求$D > N^{\frac{1}{6}}$。本文还提出了一种适用于任意$D < N$的更简单算法,运行时间为$O(D^{2.5+o(1)}\operatorname{polylog}(N))$。
英文摘要:
In this paper, we present an improvement for the problem of deterministically finding an element of large multiplicative order modulo some integer $N$. This problem arises as a key subroutine in current deterministic factoring algorithms, such as those proposed by Harvey and Hittmeir [Mathematics of Computation, 2021]. Specifically, let $D<N$ be positive integers with \begin{equation}\label{eq:abs} D > \exp\left(\sqrt{2\log N \log \log N}\right). \end{equation} We give a deterministic algorithm that does one of the following: Returns an element $a \in \mathbb{Z}_N^*$ with $\operatorname{ord}_N(a) > D$; Returns a non-trivial factor of $N$; Or reports that $N$ is prime. The running time of our algorithm is $O(D^{1/2 + o(1)})$. Similar results were independently and concurrently obtained by Harvey and Hittmeir [arXiv:2601.11131, 2026] in work that appeared while this manuscript was in preparation. Prior to these works, the best known algorithm for finding an element with order larger than $D$ was given by Oznovich and Volk [SODA 2026], requiring $D > N^{\frac{1}{6}}$. We also present a simpler algorithm that applies for any $D < N$ and runs in $O(D^{2.5+o(1)}\operatorname{polylog}(N))$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。