Skip to Main content Skip to Navigation
Conference papers

Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures

Hamza Jeljeli 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : In cryptanalysis, solving the discrete logarithm problem (DLP) is key to assessing the security of many public-key cryptosystems. The index-calculus methods, that attack the DLP in multiplicative subgroups of finite fields, require solving large sparse systems of linear equations modulo large primes. This article deals with how we can run this computation on GPU- and multi-core-based clusters, featuring InfiniBand networking. More specifically, we present the sparse linear algebra algorithms that are proposed in the literature, in particular the block Wiedemann algorithm. We discuss the parallelization of the central matrix--vector product operation from both algorithmic and practical points of view, and illustrate how our approach has contributed to the recent record-sized DLP computation in GF($2^{809}$).
Complete list of metadata
Contributor : Hamza Jeljeli Connect in order to contact the contributor
Submitted on : Thursday, December 4, 2014 - 5:51:40 PM
Last modification on : Saturday, October 16, 2021 - 11:26:06 AM
Long-term archiving on: : Monday, March 9, 2015 - 6:00:21 AM


Files produced by the author(s)


  • HAL Id : hal-00946895, version 2
  • ARXIV : 1402.3661


Hamza Jeljeli. Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures. Euro-Par 2014 Parallel Processing, Aug 2014, Porto, Portugal. ⟨hal-00946895v2⟩



Les métriques sont temporairement indisponibles