arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1202.3695math.NT
收藏

一类特殊数列的确定性椭圆曲线素性证明

Deterministic elliptic curve primality proving for a special sequence of numbers

Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong

摘要:

我们给出了一个确定性算法,非常迅速地证明了在一定的序列中的整数N的素性或复合性,使用椭圆曲线E/Q与Q(sqrt(-7))的整数环的复乘。该算法在环Z/NZ上使用O(log N)的算术运算,这意味着位复杂度在log N中是准二次的。值得注意的是,经典的“N-1”或“N+1”素性测试都不适用于我们序列中的整数。我们将讨论如何应用该算法,结合筛分技术,有效地搜索非常大的素数。这使我们能够证明几个整数的素数超过100,000个十进制数字,其中最大的有超过一百万位在其二进制表示。在它被发现的时候,它是最大的已被证明的素数N,对于它,N-1或N+1的部分因式分解是未知的。

英文摘要:

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm uses O(log N) arithmetic operations in the ring Z/NZ, implying a bit complexity that is quasi-quadratic in log N. Notably, neither of the classical "N-1" or "N+1" primality tests apply to the integers in our sequence. We discuss how this algorithm may be applied, in combination with sieving techniques, to efficiently search for very large primes. This has allowed us to prove the primality of several integers with more than 100,000 decimal digits, the largest of which has more than a million bits in its binary representation. At the time it was found, it was the largest proven prime N for which no significant partial factorization of N-1 or N+1 is known.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑