I've shared the basic pseudo code for RSA Bruteforce below. Can you please write a basic pseudo-code for this method?
You cannot solve RSA problems with the Kangaroo method because the ECDLP problem is not applicable for RSA, as there are no logarithms to solve for.
Not ECDLP but DLP so Pollard Rho and Pollard Kangaroo should be applicable no?
Rho is specifically designed for Discrete Logarithm (factoring) problem.
Also I read the Wikipedia page for Kangaroo which said that it's applicable for any group. In fact the paper for Pollard's Kangaroo originally mentioned it's use for multiplicative [again, RSA/factoring] groups.