A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
[chapter]
2015
Lecture Notes in Computer Science
In this paper, we propose two variants of the Number Field Sieve (NFS) to compute discrete logarithms in medium characteristic finite fields. We consider algorithms that combine two ideas, namely the Multiple variant of the Number Field Sieve (MNFS) taking advantage of a large number of number fields in the sieving phase, and two recent polynomial selections for the classical Number Field Sieve. Combining MNFS with the Conjugation Method, we design the best asymptotic algorithm to compute
doi:10.1007/978-3-662-46800-5_7
fatcat:g4g7zib4zzcsdanng5h4hxnouy