确定性矩阵分解算法
Deterministic Integer Factorization Algorithms
摘要:
本文提出了一种新的整数确定性因式分解算法,它的运算量可达$O(N^{1/6+\varepsilon})$的运算量。等价地,给定平衡整数$N = pq$的因子的最少$(\log N)/6$位,其中$p$和$q$是素数,该算法在多项式时间$O(\log(N)^c)$中对整数进行因子分解,其中$c \geq 0$为常数,而$\varepsilon > 0$为任意小的数。它改进了目前的确定性因式分解算法,额定在算术运算$O(N^{1/5+\varepsilon})$算术运算。
英文摘要:
A new integer deterministic factorization algorithm, rated at arithmetic operations to $O(N^{1/6+\varepsilon})$ arithmetic operations, is presented in this note. Equivalently, given the least $(\log N)/6$ bits of a factor of the balanced integer $N = pq$, where $p$ and $q$ are primes, the algorithm factors the integer in polynomial time $O(\log(N)^c)$, with $c \geq 0$ constant, and $\varepsilon > 0$ an arbitrarily small number. It improves the current deterministic factorization algorithm, rated at arithmetic operations to $O(N^{1/5+\varepsilon})$ arithmetic operations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。