Easy numbers for the Elliptic Curve primality Proving algorithm

F. Morain

doi:10.1145/143242.143326

Easy numbers for the Elliptic Curve primality Proving algorithm

F. Morain

DGA-MI

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the case for about half the numbers of the Cunningham project. Computational examples are given.

Original language	English
Title of host publication	Papers from the International Symposium on Symbolic and Algebraic Computation, ISSAC 1992
Editors	Paul S. Wang
Publisher	Association for Computing Machinery
Pages	263-268
Number of pages	6
ISBN (Electronic)	0897914899
DOIs	https://doi.org/10.1145/143242.143326
Publication status	Published - 1 Aug 1992
Event	1992 International Symposium on Symbolic and Algebraic Computation, ISSAC 1992 - Berkeley, United States Duration: 27 Jul 1992 → 29 Jul 1992

Publication series

Name	Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
Volume	Part F129620

Conference

Conference	1992 International Symposium on Symbolic and Algebraic Computation, ISSAC 1992
Country/Territory	United States
City	Berkeley
Period	27/07/92 → 29/07/92

Access to Document

10.1145/143242.143326

Cite this

Morain, F. (1992). Easy numbers for the Elliptic Curve primality Proving algorithm. In P. S. Wang (Ed.), Papers from the International Symposium on Symbolic and Algebraic Computation, ISSAC 1992 (pp. 263-268). (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC; Vol. Part F129620). Association for Computing Machinery. https://doi.org/10.1145/143242.143326

@inproceedings{838c2695a954409f98d5005aeeb82ffa,

title = "Easy numbers for the Elliptic Curve primality Proving algorithm",

abstract = "We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the case for about half the numbers of the Cunningham project. Computational examples are given.",

author = "F. Morain",

note = "Publisher Copyright: {\textcopyright} 1992 ACM.; 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC 1992 ; Conference date: 27-07-1992 Through 29-07-1992",

year = "1992",

month = aug,

day = "1",

doi = "10.1145/143242.143326",

language = "English",

series = "Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC",

publisher = "Association for Computing Machinery",

pages = "263--268",

editor = "Wang, \{Paul S.\}",

booktitle = "Papers from the International Symposium on Symbolic and Algebraic Computation, ISSAC 1992",

}

Morain, F 1992, Easy numbers for the Elliptic Curve primality Proving algorithm. in PS Wang (ed.), Papers from the International Symposium on Symbolic and Algebraic Computation, ISSAC 1992. Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, vol. Part F129620, Association for Computing Machinery, pp. 263-268, 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC 1992, Berkeley, United States, 27/07/92. https://doi.org/10.1145/143242.143326

Easy numbers for the Elliptic Curve primality Proving algorithm. / Morain, F.
Papers from the International Symposium on Symbolic and Algebraic Computation, ISSAC 1992. ed. / Paul S. Wang. Association for Computing Machinery, 1992. p. 263-268 (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC; Vol. Part F129620).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Easy numbers for the Elliptic Curve primality Proving algorithm

AU - Morain, F.

PY - 1992/8/1

Y1 - 1992/8/1

N2 - We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the case for about half the numbers of the Cunningham project. Computational examples are given.

AB - We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the case for about half the numbers of the Cunningham project. Computational examples are given.

UR - https://www.scopus.com/pages/publications/84890419238

U2 - 10.1145/143242.143326

DO - 10.1145/143242.143326

M3 - Conference contribution

AN - SCOPUS:84890419238

T3 - Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

SP - 263

EP - 268

BT - Papers from the International Symposium on Symbolic and Algebraic Computation, ISSAC 1992

A2 - Wang, Paul S.

PB - Association for Computing Machinery

T2 - 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC 1992

Y2 - 27 July 1992 through 29 July 1992

ER -

Easy numbers for the Elliptic Curve primality Proving algorithm

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this