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

Thorsten Kleinjung 1 Lucas Nussbaum 2 Emmanuel Thomé 3
2 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
3 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : 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.
Liste complète des métadonnées
Contributor : Lucas Nussbaum <>
Submitted on : Friday, July 16, 2010 - 9:34:32 AM
Last modification on : Tuesday, December 18, 2018 - 4:18:24 PM
Document(s) archivé(s) le : Tuesday, October 23, 2012 - 10:31:03 AM


Publisher files allowed on an open archive



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⟩



Record views


Files downloads