Pollard's rho algorithm for logarithms: Difference between revisions

Content deleted Content added
m Example: inserted some parentheses, needed because of C operator precedence
Example: n is not prime, corrected
Line 96:
51 1010 681 378 1010 301 416
 
That is <math>2^{681} 5^{378} = 1010 = 2^{301} 5^{416} \pmod{1019}</math> and so <math>(614-378)\gamma = \frac{681-301 \pmod{1018}</math>, for which <math>\gamma_1=10</math> is a solution as expected. As <math>n=1018</math> is not prime, the is another solution <math>\gamma_2=519</math>, for which <math>2^{416-378519} = 101014 = -5\pmod{10181019}</math>, as expectedholds.
 
==References==