The elliptic curve primality proving algorithm is one of the fastest practical algorithms for proving the primality of large numbers. Its fastest version, fastECPP, runs in heuristic time O((log N)~4). The aim of this article is to describe new ideas used when dealing with very large numbers. We illustrate these with the primality proofs of some numbers with more than 10,000 decimal digits.
展开▼
