Quote from: Kamoheapohea on November 02, 2023, 04:08:38 AM

Quote from: nomachine on November 02, 2023, 04:01:31 AM

You are right. To be more precise, we use the van Oorschot and Weiner Method of kangaroos.

I imagined if you use Gaudry Schost method (re-place a kangaroo at a new random point as soon as you hit a distinguished point) that you could have an advantage.
Especially when using tame points in the target bitrange and wild points where one or many might not be in the target bit-range (e.g. when having many targets while experimenting with division).

You would kind of saturate the tame DPs more and more while the chance to hit a DP with the wild range increases.

But today I don't think it is of much use.

You can move tame kangaroos like this:

Code:

// Random Tame StartingKey range bnL - bnU
Int TameStartingKey;
Int tsk;
new_tsk:
tsk.Rand(pow2U);
if (tsk.IsLower(&bnL)) goto new_tsk;
TameStartingKey.Set(&tsk);
//
Int tkey;
tkey.Rand(pow2W);
keys[index].Add(&TameStartingKey);// Tame keys
keys[index].Add(&tkey);