A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2) (Q5019338): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:28, 8 February 2024
scientific article; zbMATH DE number 7454006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2) |
scientific article; zbMATH DE number 7454006 |
Statements
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2) (English)
0 references
8 January 2022
0 references
discrete logarithm
0 references
real field
0 references
discrete logarithm problem
0 references
quadratic field
0 references
quadratic residue
0 references
