Implementing the asymptotically fast version of the elliptic curve primality proving algorithm

@article{Morain2007ImplementingTA,
  title={Implementing the asymptotically fast version of the elliptic curve primality proving algorithm},
  author={F. Morain},
  journal={Math. Comput.},
  year={2007},
  volume={76},
  pages={493-505}
}
  • F. Morain
  • Published 2007
  • Computer Science, Mathematics
  • Math. Comput.
The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time cannot be proven rigorously, but heuristic arguments show that it should run in time O ((log N)^5) to prove the primality of N. An asymptotically fast version of it, attributed to J. O. Shallit, runs in time O ((log N)^4). The aim of this article is to describe this version in more details, leading to actual implementations able to… Expand
52 Citations
A strategy for elliptic curve primality proving
  • 1
  • Highly Influenced
  • PDF
DUAL ELLIPTIC PRIMES AND APPLICATIONS TO CYCLOTOMY PRIMALITY PROVING
  • Highly Influenced
  • PDF
Dual Elliptic Primes and Applications to Cyclotomy Primality Proving
  • 8
  • PDF
Four primality testing algorithms
  • 32
  • PDF
An Overview of Elliptic Curve Primality Proving
  • 1
  • PDF
Constructing elliptic curves of prime order
  • 25
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 61 REFERENCES
Proving the Primality of Very Large Numbers with fastECPP
  • 20
ELLIPTIC CURVES AND PRIMALITY PROVING
  • 287
  • PDF
Primality Proving Using Elliptic Curves: An Update
  • F. Morain
  • Mathematics, Computer Science
  • ANTS
  • 1998
  • 34
Primality testing using elliptic curves
  • 60
  • PDF
Distributed Primality Proving and the Primality of (23539+1)/3
  • F. Morain
  • Mathematics, Computer Science
  • EUROCRYPT
  • 1990
  • 17
  • PDF
Primality Proving via One Round in ECPP and One Iteration in AKS
  • Qi Cheng
  • Mathematics, Computer Science
  • Journal of Cryptology
  • 2006
  • 19
  • PDF
On distinguishing prime numbers from composite numbers
  • L. Adleman
  • Mathematics, Computer Science
  • 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
  • 95
  • PDF
Fast Decomposition of Polynomials with Known Galois Group
  • 24
Solvability by radicals from an algorithmic point of view
  • 19
  • PDF
...
1
2
3
4
5
...