Please advise. Does the "Pollard's Kangaroo" method search for keys faster than the "Baby Step Giant Step (BSGS)" algorithm? Or do these methods have the same search speed?