Limits of n In the Discrete Logarithm Problem

[YourNerdiness]

Hi,

I have written a program capable of cracking a DLog problem in ~ O(0.5*n) time, but it doesn't work when in g^n (mod P), n is not less than P. Is n normally less than P in DLog problems? Any help would be appreciated.

 

[blamocur]

Have you looked at https://en.wikipedia.org/wiki/Discrete_logarithm#Algorithms ?

 

[blamocur]

Also, since [imath]g^p \equiv g (\mod p)[/imath] for prime [imath]p[/imath] you can assume that [imath]n\leq p[/imath].

 

[YourNerdiness]

Yes I have looked at that Wikipedia article, I didn't find it helpful but I have figured it out now.