Pollard's rho algorithm for logarithms: Difference between revisions

Revision as of 13:19, 13 December 2017

Revision as of 02:39, 19 March 2018

Line 21:

g(x,n) &= \begin{cases}

n & x\in S_0\\

2n \ (\bmod \pmod p) & x\in S_1\\

n+1 \ (\bmod \pmod p) & x\in S_2

\end{cases}

\\

h(x,n) &= \begin{cases}

n+1 \ (\bmod \pmod p) & x\in S_0\\

2n \ (\bmod \pmod p) & x\in S_1\\

n & x\in S_2

\end{cases}