A framework for deterministic primality proving using elliptic curves with complex multiplication
Number Theory
2016-02-24 v3
Abstract
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 time. We use this to find large primes, including the largest prime currently known whose primality cannot feasibly be proved using classical methods.
Cite
@article{arxiv.1404.0107,
title = {A framework for deterministic primality proving using elliptic curves with complex multiplication},
author = {Alexander Abatzoglou and Alice Silverberg and Andrew V. Sutherland and Angela Wong},
journal= {arXiv preprint arXiv:1404.0107},
year = {2016}
}
Comments
22 pages