arXiv · 1404.0107
A framework for deterministic primality proving using elliptic curves with complex multiplication
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.
Explore related subjects
Keep this discovery
Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong. 2014-04-01. A framework for deterministic primality proving using elliptic curves with complex multiplication. https://doi.org/10.1090/mcom/3001
Cite the original work for its findings. Save a collection to share your selection of sources.