Distributed primality proving and the primality of (23539 + 1)/3

François Morain

doi:10.1007/3-540-46877-3_10

Distributed primality proving and the primality of (2³⁵³⁹ + 1)/3

François Morain

IGFL, Université de Lyon, Université Lyon 1

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

10 Citations (Scopus)

Abstract

We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (2³⁵³⁹+1)/3, the first ordinary Titanic prime.

Original language	English
Title of host publication	Advances in Cryptology — EUROCRYPT 1990 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
Editors	Ivan Bjerre Damgard
Publisher	Springer Verlag
Pages	110-123
Number of pages	14
ISBN (Print)	9783540535874
DOIs	https://doi.org/10.1007/3-540-46877-3_10
Publication status	Published - 1 Jan 1991
Event	9th Workshop on the Theory and Application of of Cryptographic Techniques, EUROCRYPT 1990 - Aarhus, Denmark Duration: 21 May 1990 → 24 May 1990

Publication series

Name	Lecture Notes in Computer Science
Volume	473 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th Workshop on the Theory and Application of of Cryptographic Techniques, EUROCRYPT 1990
Country/Territory	Denmark
City	Aarhus
Period	21/05/90 → 24/05/90

Access to Document

10.1007/3-540-46877-3_10

Cite this

@inproceedings{f07185c1e1ba4142a73467756309d91e,

title = "Distributed primality proving and the primality of (23539 + 1)/3",

abstract = "We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (23539+1)/3, the first ordinary Titanic prime.",

author = "Fran{\c c}ois Morain",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 9th Workshop on the Theory and Application of of Cryptographic Techniques, EUROCRYPT 1990 ; Conference date: 21-05-1990 Through 24-05-1990",

year = "1991",

month = jan,

day = "1",

doi = "10.1007/3-540-46877-3\_10",

language = "English",

isbn = "9783540535874",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "110--123",

editor = "Damgard, \{Ivan Bjerre\}",

booktitle = "Advances in Cryptology {\textemdash} EUROCRYPT 1990 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings",

}

Morain, F 1991, Distributed primality proving and the primality of (2³⁵³⁹ + 1)/3. in IB Damgard (ed.), Advances in Cryptology — EUROCRYPT 1990 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science, vol. 473 LNCS, Springer Verlag, pp. 110-123, 9th Workshop on the Theory and Application of of Cryptographic Techniques, EUROCRYPT 1990, Aarhus, Denmark, 21/05/90. https://doi.org/10.1007/3-540-46877-3_10

Distributed primality proving and the primality of (2³⁵³⁹ + 1)/3. / Morain, François.
Advances in Cryptology — EUROCRYPT 1990 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. ed. / Ivan Bjerre Damgard. Springer Verlag, 1991. p. 110-123 (Lecture Notes in Computer Science; Vol. 473 LNCS).

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

TY - GEN

T1 - Distributed primality proving and the primality of (23539 + 1)/3

AU - Morain, François

PY - 1991/1/1

Y1 - 1991/1/1

N2 - We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (23539+1)/3, the first ordinary Titanic prime.

AB - We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (23539+1)/3, the first ordinary Titanic prime.

U2 - 10.1007/3-540-46877-3_10

DO - 10.1007/3-540-46877-3_10

M3 - Conference contribution

AN - SCOPUS:84946245557

SN - 9783540535874

T3 - Lecture Notes in Computer Science

SP - 110

EP - 123

BT - Advances in Cryptology — EUROCRYPT 1990 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings

A2 - Damgard, Ivan Bjerre

PB - Springer Verlag

T2 - 9th Workshop on the Theory and Application of of Cryptographic Techniques, EUROCRYPT 1990

Y2 - 21 May 1990 through 24 May 1990

ER -