Using a grid platform for solving large sparse linear systems over GF(2)

Thorsten Kleinjung (1) , Lucas Nussbaum (2) , Emmanuel Thomé (3)

1 LACAL - Laboratory for Cryptologic Algorithms
2 ALGORILLE - Algorithms for the Grid
3 CARAMEL - Cryptology, Arithmetic: Hardware and Software

In Fall 2009, the final step of the factorization of rsa768 was carried out on several clusters of the Grid'5000 platform, leading to a new record in integer factorization. This step involves solving a huge sparse linear system defined over the binary field GF(2). This article aims at describing the algorithm used, the difficulties encountered, and the methodology which led to success. In particular, we illustrate how our use of the block Wiedemann algorithm led to a method which is suitable for use on a grid platform, with both adaptability to various clusters, and error detection and recovery procedures. While this was not obvious at first, it eventually turned out that the contribution of the Grid'5000 clusters to this computation was major.

Domains: Distributed, Parallel, and Cluster Computing [cs.DC]

Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé. Using a grid platform for solving large sparse linear systems over GF(2). 11th ACM/IEEE International Conference on Grid Computing – Grid 2010, Oct 2010, Brussels, Belgium. ⟨10.1109/GRID.2010.5697952⟩. ⟨inria-00502899⟩