I am testing a piece to encrypt and decrypt messages, and I am not 100% on why the algorithm does not seem to work as expected.
My test encryption key $e =27$. My primes $p = 263$ and $q = 911$. And when I run my code to generate a decryption key, $d$, using the algorithm $d\equiv e^{-1} \pmod{ (p-1)(q-1)}$, I get $d=70643$. When I then proceed to decode my cipher, $C$, using the algorithm $C^d \pmod{ (pq)}$, I get something unexpected, and incorrect.
the message m =82020161928606013010912592501081515590315136325211464072101146304100804061004
Anyone have an idea where I may be getting this wrong please? Thanks in advance