寻找大素数
Finding Large Primes
摘要:
在本文中,我们提出并扩大后的程序获得大d位素数的任意概率。我们采用分层的方法。第一步是限制随机数池,以排除明显是复合的数字。我们首先删除任何以1,3,7或9结尾的数字。然后我们排除数字根不是3,6或9的数字。这大大降低了随机数是复合的概率。然后,我们使用素数定理来找到所选数字n是素数的概率,并使用素数测试来将n是素数的概率增加到任意高的程度。我们应用素性检验,包括基于Fermat Little定理的Euler检验和Miller-Rabin检验。我们计算了这些条件概率,并使用GNU GMP库实现了它。
英文摘要:
In this paper we present and expand upon procedures for obtaining large d digit prime number to an arbitrary probability. We use a layered approach. The first step is to limit the pool of random number to exclude numbers that are obviously composite. We first remove any number ending in 1,3,7 or 9. We then exclude numbers whose digital root is not 3, 6, or 9. This sharply reduces the probability of the random number being composite. We then use the Prime Number Theorem to find the probability that the selected number n is prime and use primality tests to increase the probability to an arbitrarily high degree that n is prime. We apply primality tests including Euler's test based on Fermat Little theorem and the Miller-Rabin test. We computed these conditional probabilities and implemented it using the GNU GMP library.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。