| Links |
|
|
| [JL11] |
A. Joux and R. Lercier. Encyclopedia of
Cryptography and Security.
Chapter Number Field Sieve for DLP, pages 867-873.
Springer, 2011.
The number field sieve for the discrete logarithm problem, or
NFS-DLP, is a family of algorithms for computing the
discrete logarithms problem in the multiplicative group of
finite fields Fq which make use of the representation of Fq
as residue fields in number fields. These are the fastest
known methods for finite fields of large characteristic, in
the general case where the fields do not have extra
properties.
[ bib |
publication ]
Back |
|
|
![[fr]](../inc/img/skin/medicis/fr.gif)
![[en]](../inc/img/skin/medicis/en.gif)
