A Heterogeneous Computing Environment to Solve the 768-bit RSA Challenge
Thorsten Kleinjung
(1)
,
Joppe W. Bos
(1)
,
Arjen K. Lenstra
(1)
,
Dag Arne Osvik
(1)
,
Kazumaro Aoki
(2)
,
Scott Contini
(3)
,
Jens Franke
(4)
,
Emmanuel Thomé
(5)
,
Pascal Jermini
(6)
,
Michela Thiémard
(6)
,
Paul Leyland
(7)
,
Peter L. Montgomery
(7)
,
Andrey Timofeev
(8)
,
Heinz Stockinger
(9)
1
LACAL -
Laboratory for Cryptologic Algorithms
2 ISL - NTT Information Sharing Platform Laboratories
3 Silverbrook Research
4 Department of Mathematics - University of Bonn
5 CARAMEL - Cryptology, Arithmetic: Hardware and Software
6 DIT - EPFL / Domaine IT
7 Microsoft Research [Redmond]
8 MAS2 - Scientific Computing and Control Theory
9 SIB - Swiss Institute of Bioinformatics [Lausanne]
2 ISL - NTT Information Sharing Platform Laboratories
3 Silverbrook Research
4 Department of Mathematics - University of Bonn
5 CARAMEL - Cryptology, Arithmetic: Hardware and Software
6 DIT - EPFL / Domaine IT
7 Microsoft Research [Redmond]
8 MAS2 - Scientific Computing and Control Theory
9 SIB - Swiss Institute of Bioinformatics [Lausanne]
Emmanuel Thomé
- Function : Author
- PersonId : 737813
- IdHAL : emmanuelthome
- ORCID : 0000-0002-5669-2195
- IdRef : 149955812
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.