Elliptic curves and primality proving 论文
1993Mathematics of Computation引用 381
Cryptography and Residue ArithmeticPolynomial and algebraic computationAlgebraic 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.