Elliptic curves and primality proving

A. O. Atkin; F. Morain

doi:10.1090/S0025-5718-1993-1199989-X

Elliptic curves and primality proving

A. O. Atkin
, F. Morain

University of Illinois at Chicago
IGFL, Université de Lyon, Université Lyon 1

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

237 Citations (Scopus)

Résumé

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.

langue originale	Anglais
Pages (de - à)	29-68
Nombre de pages	40
journal	Mathematics of Computation
Volume	61
Numéro de publication	203
Les DOIs	https://doi.org/10.1090/S0025-5718-1993-1199989-X
état	Publié - 1 janv. 1993
Modification externe	Oui

Accès au document

10.1090/S0025-5718-1993-1199989-X

Contient cette citation

@article{98c15b3fcd634ef59791c65f6e44ea80,

title = "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, n{\'u}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{\'o}se loqui superfluum foret.",

author = "Atkin, \{A. O.\} and F. Morain",

year = "1993",

month = jan,

day = "1",

doi = "10.1090/S0025-5718-1993-1199989-X",

language = "English",

volume = "61",

pages = "29--68",

journal = "Mathematics of Computation",

issn = "0025-5718",

publisher = "American Mathematical Society",

number = "203",

}

TY - JOUR

T1 - Elliptic curves and primality proving

AU - Atkin, A. O.

AU - Morain, F.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

U2 - 10.1090/S0025-5718-1993-1199989-X

DO - 10.1090/S0025-5718-1993-1199989-X

M3 - Article

AN - SCOPUS:84966219173

SN - 0025-5718

VL - 61

SP - 29

EP - 68

JO - Mathematics of Computation

JF - Mathematics of Computation

IS - 203

ER -

Elliptic curves and primality proving

Résumé

Accès au document

Empreinte digitale

Contient cette citation