Elliptic curves and primality proving

作者：A. O. L. Atkin, François Morain · 发表于：Mathematics of Computation · 年份：1993 · DOI：10.1090/s0025-5718-1993-1199989-x · 被引用次数：384 · 研究领域：Cryptography and Residue Arithmetic、Polynomial and algebraic computation、Algebraic Geometry and Number Theory

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.