Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
| dc.creator | Morain, François | |
| dc.date | 2005-02-04 | |
| dc.date.accessioned | 2026-07-07T05:16:42Z | |
| dc.date.available | 2026-07-07T05:16:42Z | |
| dc.description | 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 handle numbers with several thousands of decimal digits. | |
| dc.identifier | https://arxiv.org/abs/math/0502097 | |
| dc.identifier | http://arxiv.org/abs/math/0502097 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/74088 | |
| dc.subject | Number Theory | |
| dc.title | Implementing the asymptotically fast version of the elliptic curve primality proving algorithm | |
| dc.type | text |