Polynomial interpolation of the discrete logarithm (Q5959834): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1012556500517 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1591996813 / rank | |||
Normal rank | |||
Latest revision as of 09:32, 30 July 2024
scientific article; zbMATH DE number 1726945
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial interpolation of the discrete logarithm |
scientific article; zbMATH DE number 1726945 |
Statements
Polynomial interpolation of the discrete logarithm (English)
0 references
11 April 2002
0 references
The paper provides lower bounds on the degree and the sparsity of polynomials interpolating the discrete logarithm in a finite field. The results extend the work of \textit{D. Coppersmith} and \textit{I. E. Shparlinski} [J. Cryptology 13, 339-360 (2000; Zbl 1038.94007)] from finite prime fields to arbitrary finite fields.
0 references
lower bounds
0 references
degree
0 references
sparsity
0 references
polynomials
0 references
discrete logarithm
0 references
finite field
0 references
