Abstract
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. Problema, números primos a compositis dignoscendi, hosque in factores suos primos resolvendi, ad gravissima ac utilissima totius arithmeticae pertinere, et geometrarum turn veterum turn recentiorum industriam ac sagacitatem occupavisse, tarn notum est, ut de hac re copióse loqui superfluum foret.
| Original language | English |
|---|---|
| Pages (from-to) | 29-68 |
| Number of pages | 40 |
| Journal | Mathematics of Computation |
| Volume | 61 |
| Issue number | 203 |
| DOIs | |
| Publication status | Published - 1 Jan 1993 |
| Externally published | Yes |