A heterogeneous computing environment to solve the 768-bit RSA challenge

13Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In December 2009 the 768-bit, 232-digit number RSA-768 was factored using the number field sieve. Overall, the computational challenge would take more than 1700 years on a single, standard core. In the article we present the heterogeneous computing approach, involving different compute clusters and Grid computing environments, used to solve this problem. © 2010 Springer Science+Business Media, LLC.

Author supplied keywords

Cite

CITATION STYLE

APA

Kleinjung, T., Bos, J. W., Lenstra, A. K., Osvik, D. A., Aoki, K., Contini, S., … Stockinger, H. (2012). A heterogeneous computing environment to solve the 768-bit RSA challenge. Cluster Computing, 15(1), 53–68. https://doi.org/10.1007/s10586-010-0149-0

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