Finding a jump index



hi,

Let f(x) be a primitive polynomial modulo 2(but not a trinomial). Let
'alpha' be a primitive root of f(x). Is it possible to find a positive
integer 'j' such that alpha^j==alpha+1 in a time complexity less than
solving the discrete log problem?

Thanks,
Sarad.

.