Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N (Q1059674)
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: Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N |
scientific article; zbMATH DE number 3904709
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N |
scientific article; zbMATH DE number 3904709 |
Statements
Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N (English)
0 references
1985
0 references
The authors study the complexity of the algorithm of \textit{T. Herlestam} and \textit{R. Johannesson} [1981 IEEE International Symposium on Information Theory, Santa Monica, California, Feb. 1981; cf. BIT 21, 326- 334 (1981; Zbl 0493.12023)] for computing logarithms over \(GF(2^ n)\). Their analysis suggests that the target set (of logarithms that have to be stored) must contain all elements up to about weight n/3-8. This means that even for \(n=63\) the amount of computation needed is prohibitively large.
0 references
Herlestam-Johannesson algorithm
0 references
logarithms over finite fields
0 references
public key distribution system
0 references
complexity
0 references
