Pollard's kangaroo algorithm: Difference between revisions

Revision as of 23:57, 28 August 2019

Revision as of 01:55, 29 August 2019

Line 6:

1. Choose a set <math>S</math> of integers and define a [[pseudorandom]] map <math>f: G \rightarrow S</math>.

2. Choose an integer <math>N</math> and compute a sequence of group elements <math>\{x_0,x_1,\ldots,x_N\}</math> according to:Pollard rho kangaroo algorithm <ref>https://github.com/bitfranke/Pollard-Rho-kangaroo</ref>

* <math>x_0 = \alpha^b\,</math>

* <math>x_{i+1} = x_i\alpha^{f(x_i)}\text{ for }i=0,1,\ldots,N-1</math>