1993/01/01 by A. O. L. Atkin, François Morain · 1 citation
Computer Science · Mathematics · #Cryptography and Residue Arithmetic #Polynomial and algebraic computation #Algebraic Geometry and Number Theory
paper · doi:10.1090/s0025-5718-1993-1199989-x
openalex publication_date 1993/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
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.