Factorization of a 512-bit RSA modulus

S. Cavallar; B. Dodson; A.K. Lenstra; W.M. Lioen; P.L. Montgomery; B. Murphy; H.J.J. Riele, te

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

Factorization of a 512-bit RSA modulus

S. Cavallar, B. Dodson, A.K. Lenstra, W.M. Lioen, P.L. Montgomery, B. Murphy, H.J.J. Riele, te

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

67 Citations (Scopus)

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. Breakdown of individual contributions to this project: Management: Te Riele; polynomial selection algorithm: Montgomery, Murphy; polynomial selection computations: Dodson, Lenstra, Montgomery, Murphy; sieving codes: Lenstra, Montgomery; sieving: Aardal, Cavallar, Dodson, Gilchrist, Guillerm, Lenstra, Leyland, Lioen, Marchand, Montgomery, Morain, Muffett, Putnam, Zimmermann; filtering: Cavallar, Montgomery; linear algebra: Leyland, Montgomery; square root: Montgomery; data collection, analysis of data and running the NFS code at CWI and SARA: Cavallar, Lioen, Montgomery; technical support: Lioen

Original language	English
Title of host publication	Advances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000)
Editors	B. Preneel
Place of Publication	Berlin
Publisher	Springer
Pages	1-18
ISBN (Print)	3-540-67517-5
DOIs	https://doi.org/10.1007/3-540-45539-6_1
Publication status	Published - 2000

Publication series

Name	Lecture Notes in Computer Science
Volume	1807
ISSN (Print)	0302-9743

Access to Document

10.1007/3-540-45539-6_1

Cite this

Cavallar, S., Dodson, B., Lenstra, A. K., Lioen, W. M., Montgomery, P. L., Murphy, B., & Riele, te, H. J. J. (2000). Factorization of a 512-bit RSA modulus. In B. Preneel (Ed.), Advances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000) (pp. 1-18). (Lecture Notes in Computer Science; Vol. 1807). Springer. https://doi.org/10.1007/3-540-45539-6_1

@inproceedings{ad87aec1e30f47eba4f0f3c789f7f949,

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. Breakdown of individual contributions to this project: Management: Te Riele; polynomial selection algorithm: Montgomery, Murphy; polynomial selection computations: Dodson, Lenstra, Montgomery, Murphy; sieving codes: Lenstra, Montgomery; sieving: Aardal, Cavallar, Dodson, Gilchrist, Guillerm, Lenstra, Leyland, Lioen, Marchand, Montgomery, Morain, Muffett, Putnam, Zimmermann; filtering: Cavallar, Montgomery; linear algebra: Leyland, Montgomery; square root: Montgomery; data collection, analysis of data and running the NFS code at CWI and SARA: Cavallar, Lioen, Montgomery; technical support: Lioen",

author = "S. Cavallar and B. Dodson and A.K. Lenstra and W.M. Lioen and P.L. Montgomery and B. Murphy and {Riele, te}, H.J.J.",

year = "2000",

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

language = "English",

isbn = "3-540-67517-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "1--18",

editor = "B. Preneel",

booktitle = "Advances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000)",

address = "Germany",

}

Cavallar, S, Dodson, B, Lenstra, AK, Lioen, WM, Montgomery, PL, Murphy, B & Riele, te, HJJ 2000, Factorization of a 512-bit RSA modulus. in B Preneel (ed.), Advances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000). Lecture Notes in Computer Science, vol. 1807, Springer, Berlin, pp. 1-18. https://doi.org/10.1007/3-540-45539-6_1

Factorization of a 512-bit RSA modulus. / Cavallar, S.; Dodson, B.; Lenstra, A.K. et al.

Advances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000). ed. / B. Preneel. Berlin : Springer, 2000. p. 1-18 (Lecture Notes in Computer Science; Vol. 1807).

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

TY - GEN

T1 - Factorization of a 512-bit RSA modulus

AU - Cavallar, S.

AU - Dodson, B.

AU - Lenstra, A.K.

AU - Lioen, W.M.

AU - Montgomery, P.L.

AU - Murphy, B.

AU - Riele, te, H.J.J.

PY - 2000

Y1 - 2000

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. Breakdown of individual contributions to this project: Management: Te Riele; polynomial selection algorithm: Montgomery, Murphy; polynomial selection computations: Dodson, Lenstra, Montgomery, Murphy; sieving codes: Lenstra, Montgomery; sieving: Aardal, Cavallar, Dodson, Gilchrist, Guillerm, Lenstra, Leyland, Lioen, Marchand, Montgomery, Morain, Muffett, Putnam, Zimmermann; filtering: Cavallar, Montgomery; linear algebra: Leyland, Montgomery; square root: Montgomery; data collection, analysis of data and running the NFS code at CWI and SARA: Cavallar, Lioen, Montgomery; technical support: Lioen

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. Breakdown of individual contributions to this project: Management: Te Riele; polynomial selection algorithm: Montgomery, Murphy; polynomial selection computations: Dodson, Lenstra, Montgomery, Murphy; sieving codes: Lenstra, Montgomery; sieving: Aardal, Cavallar, Dodson, Gilchrist, Guillerm, Lenstra, Leyland, Lioen, Marchand, Montgomery, Morain, Muffett, Putnam, Zimmermann; filtering: Cavallar, Montgomery; linear algebra: Leyland, Montgomery; square root: Montgomery; data collection, analysis of data and running the NFS code at CWI and SARA: Cavallar, Lioen, Montgomery; technical support: Lioen

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

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

M3 - Conference contribution

SN - 3-540-67517-5

T3 - Lecture Notes in Computer Science

SP - 1

EP - 18

BT - Advances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000)

A2 - Preneel, B.

PB - Springer

CY - Berlin

ER -

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

Factorization of a 512-bit RSA modulus

Abstract

Publication series

Access to Document

Fingerprint

Cite this