[Toast_25]

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?

[opsiprogram]

Haha let me get back to you once I finish replicating the paper (not using QQ but a sandbox) which we have to / get to do for hw :)