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

Cluster Computing

Volumn 15, Issue 1, 2012, Pages 53-68

  Kleinjung, Thorsten ^a   Bos, Joppe W ^a   Lenstra, Arjen K ^a   Osvik, Dag Arne ^a   Aoki, Kazumaro ^b   Contini, Scott ^c   Franke, Jens ^d   Thomé, Emmanuel ^e   Jermini, Pascal ^a   Thiémard, Michela ^a   Leyland, Paul ^f   Montgomery, Peter L ^g,h   Timofeev, Andrey ^h   Stockinger, Heinz ⁱ  

^a EPFL   (Switzerland)

^b NTT CORPORATION   (Japan)

^c MACQUARIE UNIVERSITY   (Australia)

^d UNIVERSITY OF BONN   (Germany)

^e LORIA   (France)

^f Brnikat Ltd   (United Kingdom)

^g MICROSOFT RESEARCH   (United States)

^h CWI   (Netherlands)

ⁱ SWISS INSTITUTE OF BIOINFORMATICS   (Switzerland)

Author keywords

HPC; Integer factorization; RSA

Indexed keywords

COMPUTATIONAL CHALLENGES; GRID COMPUTING ENVIRONMENT; HETEROGENEOUS COMPUTING; HPC; INTEGER FACTORIZATION; NUMBER FIELD SIEVE; RSA;

COMPUTER NETWORKS; SOFTWARE ENGINEERING;

GRID COMPUTING;

EID: 84857643848     PISSN: 13867857     EISSN: 15737543     Source Type: Journal    
DOI: 10.1007/s10586-010-0149-0     Document Type: Article

References (11)

1. Aoki, K., Franke, J., Kleinjung, T., Lenstra, A. K., Osvik, D. A.: A kilobit special number field sieve factorization. In: Asiarcypt. LNCS, vol. 4833, pp. 1-12. Springer, Berlin (2007).
2. Aoki, K., Shimoyama, T., Ueda, H.: Experiments on the linear algebra step in the number field sieve. In: IWSEC. LNCS, vol. 4752, pp. 58-73. Springer, Berlin (2007).
3. Capit, N., Costa, G. D., Georgiou, Y., Huard, G., Martin, C., Mounié, G., Neyron, P., Richard, O.: A batch scheduler with high level components. In: CCGRID, pp. 776-783. IEEE Comput. Soc., Los Alamitos (2005).
4. Coppersmith, D.: Solving linear equations over GF(2): block Lanczos algorithm. Linear Algebra Appl. 192, 33-60 (1993).
5. Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comput. 62, 333-350 (1994).
6. Gordon, D. M., McCurley, K. S.: Massively parallel computation of discrete logarithms. In: Crypto. LNCS, vol. 740, pp. 312-323. Springer, Berlin (1992).
7. Kleinjung, T., Aoki, K., Franke, J., Lenstra, A. K., Thomé, E., Bos, J. W., Gaudry, P., Kruppa, A., Montgomery, P. L., Osvik, D. A., te Riele, H. J. J., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA modulus. In: Crypto. LNCS, vol. 6223, pp. 333-350. Springer, Berlin (2010).
8. Lenstra, A. K., Lenstra, H. W. Jr.: The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Berlin (1993).
9. Lenstra, A. K., Manasse, M. S.: Factoring by electronic mail. In: Eurocrypt. LNCS, vol. 434, pp. 355-371. Springer, Berlin (1989).
10. Shor, P. W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124-134. IEEE Comput. Soc., Los Alamitos (1994).
11. Stockinger, H., Pagni, M., Cerutti, L., Falquet, L.: Grid approach to embarrassingly parallel CPU-intensive bioinformatics problems. In: E-SCIENCE'06. IEEE Comput. Soc., Los Alamitos (2006).