A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex> (Q3691838): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:16, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subexponential-time algorithm for computing discrete logarithms over&lt;tex&gt;GF(p^2)&lt;/tex&gt; |
scientific article |
Statements
A subexponential-time algorithm for computing discrete logarithms over&lt;tex&gt;GF(p^2)&lt;/tex&gt; (English)
0 references
1985
0 references
cryptography
0 references
subexponential algorithm
0 references
finite field
0 references
probabilistic algorithm
0 references
logarithms
0 references
quadratic field
0 references
complexity analysis
0 references
