论文信息 - A heterogeneous computing environment to solve the 768-bit RSA challenge

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

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.

[1] Heinz Stockinger,et al. Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems , 2006, 2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06).

[2] D. Coppersmith. Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm , 1994 .

[3] Georges Da Costa,et al. 2005 IEEE International Symposium on Cluster Computing and the Grid , 2005, CCGRID.

[4] Carl Pomerance,et al. The Development of the Number Field Sieve , 1994 .

[5] Arjen K. Lenstra,et al. Factoring by Electronic Mail , 1990, EUROCRYPT.

[6] Burton S. Kaliski,et al. RSA factoring challenge , 2005, Encyclopedia of Cryptography and Security.

[7] Kevin S. McCurley,et al. Massively Parallel Computation of Discrete Logarithms , 1992, CRYPTO.

[8] Arjen K. Lenstra,et al. A Kilobit Special Number Field Sieve Factorization , 2007, ASIACRYPT.

[9] Y. Kim. Block Lanczos algorithm. , 1989 .

[10] Kazumaro Aoki,et al. Experiments on the Linear Algebra Step in the Number Field Sieve , 2007, IWSEC.

[11] Arjen K. Lenstra,et al. Factorization of a 768-Bit RSA Modulus , 2010, CRYPTO.

[12] D. Coppersmith. Solving linear equations over GF(2): block Lanczos algorithm , 1993 .

[13] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.