The Russian peasant method involves doubling and halving by 2. Therefore you will get exact remainders of either 1 or 0, which perfectly represents one of the multiplicands in binary form.
I just wanted to make sure if this is strictly true just for base 2.