Deterministic elliptic curve primality proving for a special sequence of numbers

@article{Abatzoglou2013DeterministicEC,
  title={Deterministic elliptic curve primality proving for a special sequence of numbers},
  author={Alexander Abatzoglou and Alice Silverberg and Andrew V. Sutherland and Angela Wong},
  journal={arXiv: Number Theory},
  year={2013},
  volume={1},
  pages={1-20}
}
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… Expand

Tables from this paper

Some remarks on primality proving and elliptic curves
TLDR
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. Expand
A framework for deterministic primality proving using elliptic curves with complex multiplication
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-quadraticExpand
A Novel Method of Searching Primitive Roots Modulo Fermat Prime Numbers
Primitive root is a fundamental concept in modern cryptography as well as in modern number theory. Fermat prime numbers have practical uses in several branches of number theory. As of today, there isExpand
A 60,000 digit prime number of the form $x^{2} + x + 41$
Motivated by Euler's observation that the polynomial $x^{2} + x + 41$ takes on prime values for $0 \leq x \leq 39$, we search for large values of $x$ for which $N = x^{2} + x + 41$ is prime. To applyExpand
Strongly nonzero points and elliptic pseudoprimes
We examine the notion of strongly non-zero points and use it as a tool in the study of several types of elliptic pseudoprimes. Moreover, we give give some probabilistic results about the existence ofExpand

References

SHOWING 1-10 OF 105 REFERENCES
ELLIPTIC CURVES AND PRIMALITY PROVING
This report describes the theory and implementation of the Elliptic Curve Primality Proving algorithm - ECPP - algorithm. This includes the relationships between representing primes by quadraticExpand
Primality testing using elliptic curves
TLDR
A primality proving algorithm—a probablistic primality test that produces short certificates of primality on prime inputs that is based on a new methodology for applying group theory to the problem of prime certification, and the application of this methodology using groups generated by elliptic curves over finite fields. Expand
An elliptic curve test for Mersenne primes
Abstract Let l ⩾ 3 be a prime, and let p = 2 l - 1 be the corresponding Mersenne number. The Lucas–Lehmer test for the primality of p goes as follows. Define the sequence of integers x k by theExpand
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
  • F. Morain
  • Mathematics, Computer Science
  • Math. Comput.
  • 2007
TLDR
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. Expand
Almost all primes can be quickly certified
TLDR
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. Expand
Speeding the Pollard and elliptic curve methods of factorization
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module N and occasionally taking GCDs with N. These began with Pollard's p 1Expand
Every Prime has a Succinct Certificate
  • V. Pratt
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1975
TLDR
It remains an open problem whether a prime n can be recognized in only $\log _2^\alpha n$ operations of a Turing machine for any fixed $\alpha $. Expand
Testing Mersenne Primes with Elliptic Curves
TLDR
A practical approach to an elliptic curve test of Gross for Mersenne primes, which is more efficient than the Lucas-Lehmer test, but still as simple, elegant and practical. Expand
Modular multiplication without trial division
Let N > 1. We present a method for multiplying two integers (called N-residues) modulo N while avoiding division by N. N-residues are represented in a nonstandard way, so this method is useful onlyExpand
Deterministic primality tests based on tori and elliptic curves
TLDR
The proposed general machinery provides several series of tests which include, as special cases, tests discovered by Gross and by Denomme and Savin for Mersenne and Fermat primes, primes of the form 2 2 l + 1 − 2L + 1 , as well as some new ones. Expand
...
1
2
3
4
5
...