Skip to main content
Conference ProceedingsOPEN ACCESS

Factorization of a 512–bit RSA modulus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1807 1-18
DOI: 10.1007/3-540-45539-6_1
67Citations
Citations of this article
78Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Cavallar, S., Dodson, B., Lenstra, A. K., Lioen, W., Montgomery, P. L., Murphy, B., … Zimmermann, P. (2000). Factorization of a 512–bit RSA modulus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1807, pp. 1–18). Springer Verlag. https://doi.org/10.1007/3-540-45539-6_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free