Improvements to the general number field sieve for discrete logarithms in prime fields - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematics of Computation Année : 2003

Improvements to the general number field sieve for discrete logarithms in prime fields

Résumé

In this paper, we describe many improvements to the number field sieve. Our main contribution consists of a new way to compute individual logarithms with the number field sieve without solving a very large linear system for each logarithm. We show that, with these improvements, the number field sieve outperforms the gaussian integer method in the hundred digit range. We also illustrate our results by successfully computing discrete logarithms with GNFS in a large prime field.

Dates et versions

hal-01102016 , version 1 (11-01-2015)

Identifiants

Citer

Antoine Joux, Reynald Lercier. Improvements to the general number field sieve for discrete logarithms in prime fields: A comparison with the Gaussian integer method. Mathematics of Computation, 2003, 72, pp.953-967. ⟨10.1090/S0025-5718-02-01482-5⟩. ⟨hal-01102016⟩
5658 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More