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

作者:Kleinjung Thorsten; Bos Joppe W; Lenstra Arjen K*; Osvik Dag Arne; Aoki Kazumaro; Contini Scott; Franke Jens; Thome Emmanuel; Jermini Pascal; Thiemard Michela; Leyland Paul; Montgomery Peter L; Timofeev Andrey; Stockinger Heinz
来源:Cluster Computing, 2012, 15(1): 53-68.
DOI:10.1007/s10586-010-0149-0

摘要

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.

  • 出版日期2012-3
  • 单位INRIA; Microsoft