Computing individual discrete logarithms faster in \(\mathrm{GF}(p^n)\) with the NFS-DL algorithm (Q2811129)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing individual discrete logarithms faster in GF(p^n) with the NFS-DL algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing individual discrete logarithms faster in \(\mathrm{GF}(p^n)\) with the NFS-DL algorithm |
scientific article |
Statements
Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm (English)
0 references
10 June 2016
0 references
discrete logarithm
0 references
finite field
0 references
number field sieve
0 references
individual logarithm
0 references
0.8527899384498596
0 references
0.8440375924110413
0 references
0.8372856974601746
0 references
0.8370102047920227
0 references
