Then perhaps you could point me in the right direction:

where Cb = C (2^(be) mod(n)) (mod n)

I assume we are calculating Cb by encrypting the bit-shift and then applying it to C (which is already encrypted). Why do we need that last modulus at the end?