Publication

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

Arjen Lenstra, Thorsten Kleinjung, Dag Arne Osvik
2012
Journal Articles

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.

Official source

https://infoscience.epfl.ch/entities/publication/39420562-fd5e-483f-9203-10c938a82e93

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Chat with Graph Search

Live-cell imaging powered by computation

Hausdorff dimension of fermions on a random lattice

Orchestrating chromosome conformation capture analysis with Bioconductor