# Finding a jump index

*From*: "Sarad AV" <esarad@xxxxxxxxx>*Date*: 11 Dec 2005 05:19:14 -0800

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.

.

- Prev by Date:
**Re: risk due to pre-generated password tables?** - Next by Date:
**Re: Where *IS* Tom?** - Previous by thread:
**Suitable key Algorithm for 256 bits symmetric block cipher??** - Next by thread:
**Rather Newb-ish Question** - Index(es):