相关论文: Sharpening "Primes is in P" for a large family of …

Prime numbers play a very vital role in modern cryptography and especially the difficulties involved in factoring numbers composed of product of two large prime numbers have been put to use in many modern cryptographic designs. Thus, the…

We remark that the AKS primality testing algorithm [Annals of Mathematics 160 (2), 2004] needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits. The requirement is very hard to meet. The complexity class P which…

In this paper we generalize the classical Proth's theorem for integers of the form $N=Kp^n+1$. For these families, we present a primality test whose computational complexity is $\widetilde{O}(\log^2(N))$ and, what is more important, that…

We develop a simple $O((\log n)^2)$ test as an extension of Proth's test for the primality for $p2^n+1$, $p>2^n$. This allows for the determination of large, non-Sierpinski primes $p$ and the smallest $n$ such that $p2^n+1$ is prime. If $p$…

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…

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…

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…

We describe a primality test for number $M=(2p)^{2^n}+1$ with odd prime $p$ and positive integer $n$. And we also give the special primality criteria for all odd primes $p$ not exceeding 19. All these primality tests run in polynomial time…

Polynomial time primality tests for specific classes of numbers of the form $k\cdot 2^m \pm 1$ are introduced.

In this paper, a random primality proving algorithm is proposed, which generates prime certificate of length O(log n). The certificate can be verified in deterministic time O(log^4 n). The algorithm runs in heuristical time tilde{O}(log^4…

We propose some primality tests for 2^kn-1, where k, n in Z, k>= 2 and n odd. There are several tests depending on how big n is. These tests are proved using properties of elliptic curves. Essentially, the new primality tests are the…

We propose an algorithm determining the primality of numbers $M=Ap^n+w_n$ where $w_n^{p-1}\equiv1\pmod{p^n}$ and $A<p^n$ and give example when $p=7$. $p$ th reciprocity law is involved. The algorithm runs in polynomial time in $\log_2(M)$…

In this paper, two approximation algorithms are given. Let N be an odd composite number. The algorithms give new directions regarding primality test of given N. The first algorithm is given using a new method called digital coding method.…

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…

Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…

Generalized Cullen Numbers are positive integers of the form $C_b(n):=nb^n+1$. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is…

We present a variant of the Agrawal-Biswas algorithm, a Monte Carlo algorithm which tests the primality of an integer $N$ by checking whether or not $(x+a)^N$ and $x^N + a$ are equivalent in a residue ring of $\mathbb{Z}/N\mathbb{Z}[x]$.…

We develop an algebraic framework over arbitrary quadratic fields $L = \mathbb{Q}(\sqrt{D})$ to generalize the Miller-Rabin primality test. Consequently, we present a deterministic primality test for integers of the form $N = K p^{\ell} -…

The Lucas-Lehmer (LL) primality test for Mersenne numbers is the fastest known primality test. In 1969, Hans Riesel published a modification of LL to test numbers of the form $N = h \cdot 2^n - 1$, where $h < 2^n$ is an odd integer and $n…

The Baillie-PSW primality test combines Fermat and Lucas probable prime tests. It reports that a number is either composite or probably prime. No odd composite integer has been reported to pass this combination of primality tests if the…