Parallel Structured Gaussian Elimination for the Number Field Sieve - Archive ouverte HAL Access content directly
Journal Articles Mathematical Cryptology Year : 2021

Parallel Structured Gaussian Elimination for the Number Field Sieve

(1) , (2)
1
2

Abstract

This article describes a parallel algorithm for the Structured Gaussian Elimination step of the Number Field Sieve (NFS). NFS is the best known method for factoring large integers and computing discrete logarithms. State-of-the-art algorithms for this kind of partial sparse elimination, as implemented in the CADO-NFS software tool, were unamenable to parallel implementations. We therefore designed a new algorithm from scratch with this objective and implemented it using OpenMP. The result is not only faster sequentially, but scales reasonably well: using 32 cores, the time needed to process two landmark instances went down from 38 minutes to 21 seconds and from 6.7 hours to 2.3 minutes, respectively. This parallel algorithm was used for the factorization records of RSA-240 and RSA-250, and for the DLP-240 discrete logarithm record.
Fichier principal
Vignette du fichier
merge.pdf (885.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02098114 , version 1 (12-04-2019)
hal-02098114 , version 2 (05-01-2021)

Identifiers

  • HAL Id : hal-02098114 , version 2

Cite

Charles Bouillaguet, Paul Zimmermann. Parallel Structured Gaussian Elimination for the Number Field Sieve. Mathematical Cryptology, 2021, 1, pp.22-39. ⟨hal-02098114v2⟩
584 View
741 Download

Share

Gmail Facebook Twitter LinkedIn More