Français
3. Calculation of a 240-digit discrete logarithm
At first glance, the NFS-DL variant of the NFS algorithm is quite similar to that used for integer factorization. Indeed, the main steps are the same (see § 2 ). In fact, some of the software bricks are entirely shared between the two variants. This is the case of the program that collects the billions of relations which, once filtered, form the matrix on which the linear algebra step is...
The Ultimate Scientific and Technical Reference
This article is included in
Security of information systems
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Calculation of a 240-digit discrete logarithm
Conclusion
Bibliography
- (1) - AGENCE NATIONALE DE LA SÉCURITÉ DES SYSTÈMES D'INFORMATION - Référentiel général de sécurité, v2.03, Annexe B1. - Téléchargeable via https://www.ssi.gouv.fr/uploads/2014/11/RGS_v-2-0_B1.pdf (2014).
Websites
Computations of discrete logarithms, Laurent Grémy :
Wikipedia Integer factorization records :
https://en.wikipedia.org/wiki/Integer_factorization_records
Wikipedia RSA numbers...
The Ultimate Scientific and Technical Reference
