# Primality testing using elliptic curves

```@article{Goldwasser1999PrimalityTU,
title={Primality testing using elliptic curves},
author={Shafi Goldwasser and Joe Kilian},
journal={J. ACM},
year={1999},
volume={46},
pages={450-472}
}```
• Published 1 July 1999
• Mathematics, Computer Science
• J. ACM
We present a primality proving algorithm—a probablistic primality test that produces short certificates of primality on prime inputs. We prove that the test runs in expected polynomial time for all but a vanishingly small fraction of the primes. As a corollary, we obtain an algorithm for generating large certified primes with distribution statistically close to uniform. Under the conjecture that the gap between consecutive primes is bounded by some polynomial in their size, the test is shown to…

## Figures from this paper

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.
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.
Mathematics, Computer Science
• 2013
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
F. Morain
Computer Science, Mathematics
Math. Comput.
• 2007
The elliptic curve primality proving algorithm is one of the current fastest practical algorithms for proving the primality of large numbers, and an asymptotically fast version, attributed to J. O. Shallit, is described.
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.
The paper proposes new theorems by which any prime number can be calculated from the knowledge of any other prime number of lower value in a simple way and proves to be a common thread through which all the prime numbers of a number system can be related.
Computer Science
• 2016
This paper proves the necessary and sufficient condition for AKS primality test, and an improved AKS algorithm is proposed using Fermat’s Little Theorem, which becomes an enhanced Miller-Rabin probabilistic algorithm, which can generate primes as fast as the Miller- Rabin algorithm does.
An overview of a method for using elliptic curves with complex multiplication to give efficient deterministic polynomial time primality tests for the integers in sequences of a special form used to find the largest proven primes.
Mathematics, Computer Science
Math. Comput.
• 2016
We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic
Computer Science, Mathematics
Electron. Colloquium Comput. Complex.
• 2011
A new type of probabilistic search algorithm, which is guaranteed to run in expected polynomial time, and to produce a correct and unique solution with high probability is introduced, called the Bellagio algorithm.
Computer Science, Mathematics
• 1993
The Elliptic Curve Primality Proving algorithm - ECPP - is described, which can prove the primality of 100-digit numbers in less than five minutes on a SUN 3/60 workstation, and can treat all numbers with less than 1000 digits in a reasonable amount of time using a distributed implementation.
The Goldwasser-Kilian algorithm is the first to yield a polynomial size proof of its assertions, ensuring correctness while still provably running fast on most inputs, and this new primality test implies for the first time and without any assumptions that large certified primes can be generated in expectedPolynomial time under a distribution that is close to uniform.
Computer Science, Mathematics
STOC '86
• 1986
A new probabilistie primality test is presented, different from the tests of Miller, Solovay-Strassen, and Rabin in that its assertions of primality are certain, rather than being correct with high probability or dependent on an unproven assumption.
Mathematics, Computer Science
• 1989
This paper answers affirmatively the question of whether there exists an infinite set of primes whose membership can be tested in polynomial time, and shows how to randomly produce a proof of the primality of n.
G. Miller
Computer Science, Mathematics
STOC
• 1975
It is shown that primality is testable in time a polynomial in the length of the binary representation of a number, and a partial solution is given to the relationship between the complexity of computing the prime factorization of a numbers, computing the Euler phi function, and computing other related functions.
An overview of cyclotomy from the perspective of the recent research and implementation is given and the drawbacks of the algorithm — the overpolynomial run time and lack of certificates — are discussed and some open problems which may lead to future improvements are mentioned.
A deterministic algorithm to compute the number of F^-points of an elliptic curve that is defined over a finite field Fv and which is given by a Weierstrass equation is presented.
The problem of calculating the trace of an elliptic curve over a finite field has attracted considerable interest in recent years. There are many good reasons for this. The question is intrinsically
Mathematics
ISSAC '89
• 1989
A modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctness which may be verified in polynomial time.
This paper is devoted to the description and analysis of a new algorithm to factor positive integers that depends on the use of elliptic curves and it is conjectured that the algorithm determines a non-trivial divisor of a composite number n in expected time at most K( p)(log n)2.