A Note on the Linear Complexity Profile of the Discrete Logarithm in Finite Fields
Arne Winterhof · Birkhäuser Basel eBooks · 2004
We essentially improve lower bounds on the linear complexity of a sequence representing the residues of the discrete logarithm in a finite field modulo a divisor of the order of the multiplicative group. More generally, we present the result as a bound on the linear complexity profile. The proof is based on character sum bounds.