Parallel Structured Gaussian Elimination ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
Parallel Structured Gaussian Elimination for the Number Field Sieve
Auteur(s) :
Bouillaguet, Charles [Auteur correspondant]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Zimmermann, Paul [Auteur]
Cryptology, arithmetic : algebraic methods for better algorithms [CARAMBA]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Zimmermann, Paul [Auteur]
Cryptology, arithmetic : algebraic methods for better algorithms [CARAMBA]
Titre de la revue :
Mathematical Cryptology
Pagination :
22-39
Éditeur :
Florida Online Journals
Date de publication :
2021-01-08
Mot(s)-clé(s) en anglais :
parallel algorithm
Structured Gaussian Elimination
Number Field Sieve
Structured Gaussian Elimination
Number Field Sieve
Discipline(s) HAL :
Informatique [cs]/Algorithme et structure de données [cs.DS]
Résumé en anglais : [en]
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. ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-02098114v2/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-02098114v2/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-02098114v2/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- merge.pdf
- Accès libre
- Accéder au document