Conference ProceedingsOPEN ACCESS

Factorization of a 768-Bit RSA modulus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6223 LNCS 333-350
DOI: 10.1007/978-3-642-14623-7_18
245Citations
Citations of this article
267Readers
Mendeley users who have this article in their library.

Abstract

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA. © 2010 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Kleinjung, T., Aoki, K., Franke, J., Lenstra, A. K., Thomé, E., Bos, J. W., … Zimmermann, P. (2010). Factorization of a 768-Bit RSA modulus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6223 LNCS, pp. 333–350). https://doi.org/10.1007/978-3-642-14623-7_18

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