Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N
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.
scientific article; zbMATH DE number 3904709