A framework for deterministic primality proving using elliptic curves with complex multiplication
classification
🧮 math.NT
keywords
primalitycomplexcurvesdeterministicellipticframeworkmultiplicationcannot
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.