Elliptic curves and primality proving
Abstract
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. Problema, numeros primos a compositis dignoscendi, hosque in factores suos primos resolvendi, ad gravissima ac utilissima totius arithmeticae pertinere, et geometrarum tum veterum tum recentiorum industriam ac sagacitatem occupavisse, tam notum est, ut de hac re copiose loqui superfluum foret.
- Publication:
-
Mathematics of Computation
- Pub Date:
- July 1993
- DOI:
- 10.1090/S0025-5718-1993-1199989-X
- Bibcode:
- 1993MaCom..61...29A