arXiv 0801.38402008-01-24math.NT

Four primality testing algorithms

Rene Schoof

备注：: 21 pages

英文摘要：

In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time algorithm to prove that a given numer is either prime or composite. The third and fourth primality tests are at present most widely used in practice. Both tests are capable of proving that a given number is prime or composite, but neither algorithm is deterministic. The third algorithm exploits the arithmetic of cyclotomic fields. Its running time is almost, but not quite polynomial time. The fourth algorithm exploits elliptic curves. Its running time is difficult to estimate, but it behaves well in practice.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Geometric primality tests using curves of genus 1 & 2

We revisit and generalize some geometric techniques behind deterministic primality testing for some integer sequences using curves of genus 1 over finite rings. Subsequently we develop a similar primality test using the Jacobian of a genus 2 curve.

2017-10-13math.NT

A remark on primality testing and decimal expansions

We show that for any fixed base $a$, a positive proportion of primes have the property that they become composite after altering any one of their digits in the base $a$ expansion; the case $a=2$ was already established by Cohen-Selfridge and Sun, using some covering congruence ideas of Erdős. Our method is slightly different, using a partially covering set of congruences followed by an application of the Selberg sieve upper bound. As a consequence, it is not always possible to test whether a number is prime from its base $a$ expansion without reading all of its digits. We also present some sli…

2010-04-18math.NT

Kummer surfaces for primality testing

We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most of the integers in these families and discuss in detail the necessary steps to implement this algorithm in a computer. Although an indetermination is possible, in which case another choice of initial parameters should be used, we prove that the probability of reaching this situation is exceedingly low and decreases exponentially with $n$.

2020-05-19math.AGmath.NT

基于佩尔三次曲线的新型高效素性测试

Novel performant primality test on a Pell's cubic

本研究提出一种基于佩尔三次曲线的新型素性测试算法，通过相关整数序列证明其必要素性条件，运算量随输入整数比特长度线性增长，对小于2的32次方的整数具有确定性，为公钥密码学提供了新的素性测试方案。

2024-11-03math.NT

因数分解与素性测试的进展：从经典到量子算法

Taxonomy and Practical Evaluation of Primality Testing Algorithms

King Fahd University of Petroleum and Minerals（国王法赫德国立石油与矿产大学）

本文综述并分类了经典和量子算法用于因数分解与素性测试，分析其优劣、时间复杂度及应用比较，揭示量子算法在因数分解上的优势，但素性测试方面尚未有明显突破。

2026-07-03cs.CRmath.NT

Dual Elliptic Primes and Applications to Cyclotomy Primality Proving

Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving algorithms. By extending to elliptic curves some notions of galois theory of rings used in the cyclotomy primality tests, one obtains a new algorithm which has heuristic cubic run time and generates certificates that can be verified in quadratic time. After the break through of Agrawal, Kayal and Saxena has settled the complexity theoretical problem of primality testi…

2007-09-26math.NTmath.RA

更多相关论文收起更多论文

The number of multinomial coefficients based on a set of partitions of n into k parts and divided by k evenly

In this paper we obtained an original integer sequence based on the properties of the multinomial coefficient. We investigated a property of the sequence that shows connection with a primality testing. For any prime n the n-th term in the sequence is less by 1 than the number of partitions of n. We hypothesize the existence of an asymptotic algorithm of primality testing.

2012-04-30math.COmath.NT

PPT: New Low Complexity Deterministic Primality Tests Leveraging Explicit and Implicit Non-Residues. A Set of Three Companion Manuscripts

In this set of three companion manuscripts/articles, we unveil our new results on primality testing and reveal new primality testing algorithms enabled by those results. The results have been classified (and referred to) as lemmas/corollaries/claims whenever we have complete analytic proof(s); otherwise the results are introduced as conjectures. In Part/Article 1, we start with the Baseline Primality Conjecture~(PBPC) which enables deterministic primality detection with a low complexity = O((log N)^2) ; when an explicit value of a Quadratic Non Residue (QNR) modulo-N is available (which happen…

2019-08-20cs.CCcs.CRcs.DS

关于八级定理及其在 Mersenne 素数的 Lucas-Lehmer 素性检验中的应用，I

On the Eight Levels theorem and applications towards Lucas-Lehmer primality test for Mersenne primes, I

本文证明了八级定理，并基于此提出了三种 Lucas-Lehmer Mersenne 素性检验新版本及一个 Mersenne 合数新判据，以提升算法效率并促进新 Mersenne 素数的发现。

2023-05-11cs.CRmath.COmath.NT

从最坏情形到平均情形再到增量搜索：强Lucas测试的界

From Worst to Average Case to Incremental Search Bounds of the Strong Lucas Test

本文研究强Lucas测试的错误界，证明通过t轮连续测试及额外标准测试的整数为素数的概率大于1-(4/15)^t，并首次给出基于强Lucas测试的增量搜索算法的错误界。

2024-06-07cs.CRmath.NT

Deterministic methods to find primes

Given a large positive integer $N$, how quickly can one construct a prime number larger than $N$ (or between $N$ and 2N)? Using probabilistic methods, one can obtain a prime number in time at most $\log^{O(1)} N$ with high probability by selecting numbers between $N$ and 2N at random and testing each one in turn for primality until a prime is discovered. However, if one seeks a deterministic method, then the problem is much more difficult, unless one assumes some unproven conjectures in number theory; brute force methods give a $O(N^{1+o(1)})$ algorithm, and the best unconditional algorithm, d…

2012-05-26math.NT

Quantum Computation of Prime Number Functions

We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than 2^n, where n is the number of qubits of the register. This Prime state can be built using Grover's algorithm, whose oracle is a quantum implementation of the classical Miller-Rabin primality test. The Prime state is highly entangled, and its entanglement measures encode number theoretical functions such as the distribution of twin primes or the Chebyshev bias. This algorithm can be further combined with the quantum Fourier transform to yield an estimate of the prime …

2013-09-05math.NTquant-ph