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

Authors:
Thorsten Kleinjung;Joppe W. Bos;Arjen K. Lenstra;Dag Arne Osvik;Kazumaro Aoki;Scott Contini;Jens Franke;Emmanuel Thomé;Pascal Jermini;Michela Thiémard;Paul Leyland;Peter L. Montgomery;Andrey Timofeev;Heinz Stockinger
Affiliations:
EPFL IC LACAL, Lausanne, Switzerland 1015;EPFL IC LACAL, Lausanne, Switzerland 1015;EPFL IC LACAL, Lausanne, Switzerland 1015;EPFL IC LACAL, Lausanne, Switzerland 1015;NTT, Tokyo, Japan 180-8585;Macquarie University, Sydney, Australia;Department of Mathematics, University of Bonn, Bonn, Germany 53115;INRIA CNRS LORIA, Équipe CARAMEL, Villers-lès- Nancy Cedex, France 54602;EPFL AI DIT, Lausanne, Switzerland 1015;EPFL AI DIT, Lausanne, Switzerland 1015;Brnikat Ltd, Cambridge, UK CB22 5HJ;Microsoft Research, Redmond, USA 98052 and CWI, Amsterdam, The Netherlands 1090 GB;CWI, Amsterdam, The Netherlands 1090 GB;Vital-IT Group, Swiss Institute of Bioinformatics, Lausanne, Switzerland 1015
Venue:
Cluster Computing
Year:
2012

Citing 9
Cited 2

Factoring by electronic mail

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm

Mathematics of Computation
Massively Parallel Computation of Discrete Logarithms

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A batch scheduler with high level components

CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems

E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Experiments on the linear algebra step in the number field sieve

IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
A kilobit special number field sieve factorization

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Factorization of a 768-bit RSA modulus

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology

Iterative sparse Matrix-Vector multiplication for integer factorization on GPUs

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
On the strength comparison of the ECDLP and the IFP

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks

Quantified Score

Hi-index	0.00

Visualization

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.