Improvements to the general number field sieve for discrete logarithms in prime fields (2003)
| Venue: | Mathematics of Computation |
| Citations: | 11 - 1 self |
BibTeX
@ARTICLE{Joux03improvementsto,
author = {Antoine Joux and Reynald Lercier},
title = {Improvements to the general number field sieve for discrete logarithms in prime fields},
journal = {Mathematics of Computation},
year = {2003},
volume = {72},
pages = {953--967}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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. 1.
