Approximation of the Discrete Logarithm by Boolean Functions
Igor E. Shparlinski · Birkhäuser Basel eBooks · 2003
Here we consider the bitwise approximation of the discrete logarithm given the bit representation of the argument. Moreover, we concentrate on the rightmost bit of ind x. This question is essentially equivalent to deciding quadratic residuacity of x. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.