Factorization of a 512–bit RSA modulus

Stefania Cavallar; Bruce Dodson; Arjen K. Lenstra; Walter Lioen; Peter L. Montgomery; Brian Murphy; Herman Te Riele; Karen Aardal; Jeff Gilchrist; Gérard Guillerm; Paul Leyland; Joël Marchand; François Morain; Alec Muffett; Chris Craig Putnam; Paul Zimmermann

doi:10.1007/3-540-45539-6_1

Factorization of a 512–bit RSA modulus

Stefania Cavallar
, Bruce Dodson
, Arjen K. Lenstra
, Walter Lioen
, Peter L. Montgomery
, Brian Murphy
, Herman Te Riele
, Karen Aardal
, Jeff Gilchrist
, Gérard Guillerm
, Paul Leyland
, Joël Marchand
, François Morain
, Alec Muffett
, Chris Craig Putnam
, Paul Zimmermann

Centrum Wiskunde and Informatica
Lehigh University
Citibank
Microsoft Research and CWI
Australian National University
Universiteit Utrecht
Entrust Technologies
Microsoft Research Cambridge
Sun Microsystems
LORIA and INRIA Lorraine

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

Abstract

This paper reports on the factorization of the 512–bit number RSA–155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.

Original language	English
Title of host publication	Advances in Cryptology - EUROCRYPT 2000 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings
Editors	Bart Preneel
Publisher	Springer Verlag
Pages	1-18
Number of pages	18
ISBN (Print)	9783540675174
DOIs	https://doi.org/10.1007/3-540-45539-6_1
Publication status	Published - 1 Jan 2000
Event	19th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2000 - Bruges, Belgium Duration: 14 May 2000 → 18 May 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1807
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	19th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2000
Country/Territory	Belgium
City	Bruges
Period	14/05/00 → 18/05/00

Access to Document

10.1007/3-540-45539-6_1

Cite this

Cavallar, S., Dodson, B., Lenstra, A. K., Lioen, W., Montgomery, P. L., Murphy, B., Te Riele, H., Aardal, K., Gilchrist, J., Guillerm, G., Leyland, P., Marchand, J., Morain, F., Muffett, A., Craig Putnam, C., & Zimmermann, P. (2000). Factorization of a 512–bit RSA modulus. In B. Preneel (Ed.), Advances in Cryptology - EUROCRYPT 2000 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings (pp. 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1807). Springer Verlag. https://doi.org/10.1007/3-540-45539-6_1

Cavallar, Stefania ; Dodson, Bruce ; Lenstra, Arjen K. et al. / Factorization of a 512–bit RSA modulus. Advances in Cryptology - EUROCRYPT 2000 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. editor / Bart Preneel. Springer Verlag, 2000. pp. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{29aa22b117e4421096275118ac8e8657,

title = "Factorization of a 512–bit RSA modulus",

abstract = "This paper reports on the factorization of the 512–bit number RSA–155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.",

author = "Stefania Cavallar and Bruce Dodson and Lenstra, \{Arjen K.\} and Walter Lioen and Montgomery, \{Peter L.\} and Brian Murphy and \{Te Riele\}, Herman and Karen Aardal and Jeff Gilchrist and G{\'e}rard Guillerm and Paul Leyland and Jo{\"e}l Marchand and Fran{\c c}ois Morain and Alec Muffett and \{Craig Putnam\}, Chris and Paul Zimmermann",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 19th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2000 ; Conference date: 14-05-2000 Through 18-05-2000",

year = "2000",

month = jan,

day = "1",

doi = "10.1007/3-540-45539-6\_1",

language = "English",

isbn = "9783540675174",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--18",

editor = "Bart Preneel",

booktitle = "Advances in Cryptology - EUROCRYPT 2000 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings",

}

Cavallar, S, Dodson, B, Lenstra, AK, Lioen, W, Montgomery, PL, Murphy, B, Te Riele, H, Aardal, K, Gilchrist, J, Guillerm, G, Leyland, P, Marchand, J, Morain, F, Muffett, A, Craig Putnam, C & Zimmermann, P 2000, Factorization of a 512–bit RSA modulus. in B Preneel (ed.), Advances in Cryptology - EUROCRYPT 2000 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1807, Springer Verlag, pp. 1-18, 19th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2000, Bruges, Belgium, 14/05/00. https://doi.org/10.1007/3-540-45539-6_1

Factorization of a 512–bit RSA modulus. / Cavallar, Stefania; Dodson, Bruce; Lenstra, Arjen K. et al.
Advances in Cryptology - EUROCRYPT 2000 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. ed. / Bart Preneel. Springer Verlag, 2000. p. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1807).

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

TY - GEN

T1 - Factorization of a 512–bit RSA modulus

AU - Cavallar, Stefania

AU - Dodson, Bruce

AU - Lenstra, Arjen K.

AU - Lioen, Walter

AU - Montgomery, Peter L.

AU - Murphy, Brian

AU - Te Riele, Herman

AU - Aardal, Karen

AU - Gilchrist, Jeff

AU - Guillerm, Gérard

AU - Leyland, Paul

AU - Marchand, Joël

AU - Morain, François

AU - Muffett, Alec

AU - Craig Putnam, Chris

AU - Zimmermann, Paul

PY - 2000/1/1

Y1 - 2000/1/1

N2 - This paper reports on the factorization of the 512–bit number RSA–155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.

AB - This paper reports on the factorization of the 512–bit number RSA–155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.

U2 - 10.1007/3-540-45539-6_1

DO - 10.1007/3-540-45539-6_1

M3 - Conference contribution

AN - SCOPUS:77956089601

SN - 9783540675174

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 18

BT - Advances in Cryptology - EUROCRYPT 2000 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings

A2 - Preneel, Bart

PB - Springer Verlag

T2 - 19th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2000

Y2 - 14 May 2000 through 18 May 2000

ER -

Cavallar S, Dodson B, Lenstra AK, Lioen W, Montgomery PL, Murphy B et al. Factorization of a 512–bit RSA modulus. In Preneel B, editor, Advances in Cryptology - EUROCRYPT 2000 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Springer Verlag. 2000. p. 1-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45539-6_1

Factorization of a 512–bit RSA modulus

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this